RESEARCH PAPERS: Design Automation Papers

On the Global Convergence of Nonlinear Programming Algorithms

[+] Author and Article Information
K. Schittkowski

Institut für Informatik, Universität Stuttgart, 7000 Stuttgart 1, Germany F.R.

J. Mech., Trans., and Automation 107(4), 454-458 (Dec 01, 1985) (5 pages) doi:10.1115/1.3260745 History: Received November 19, 1984; Online November 19, 2009


In a previous paper a unified outline of some of the most successful nonlinear programming methods was presented by the author, i.e. of penalty, multiplier, sequential quadratic programming, and generalized reduced gradient algorithms, to illustrate their common mathematical features and to explain the different numerical performance observed in practice. By defining a general algorithmic frame for all these approaches, a global convergence result can be achieved in the sense that starting from an arbitrary initial point, a stationary solution will be approximated.

Copyright © 1985 by ASME
Your Session has timed out. Please sign back in to continue.






Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In