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.
On the Global Convergence of Nonlinear Programming Algorithms
Institut fu¨r Informatik, Universita¨t Stuttgart, 7000 Stuttgart 1, Germany F.R.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Schittkowski, K. (December 1, 1985). "On the Global Convergence of Nonlinear Programming Algorithms." ASME. J. Mech., Trans., and Automation. December 1985; 107(4): 454–458. https://doi.org/10.1115/1.3260745
Download citation file:
- Ris (Zotero)
- Reference Manager
Get Email Alerts
A Machine Learning Enabled Multi-Fidelity Platform for the Integrated Design of Aircraft Systems
J. Mech. Des (December 2019)
Special Issue: Machine Learning for Engineering Design
J. Mech. Des (November 2019)