The four most successful approaches for solving the constrained nonlinear programming problem are the penalty, multiplier, sequential quadratic programming, and generalized reduced gradient methods. A general algorithmic frame will be presented, which realizes any of these methods only by specifying a search direction for the variables, a multiplier estimate, and some penalty parameters in each iteration. This approach allows one to illustrate common mathematical features and, on the other hand, serves to explain the different numerical performance results we observe in practice.
A Unified Outline of Nonlinear Programming Algorithms
Institut fu¨r Informatik, Universita¨t Stuttgart, 7000 Stuttgart 1, West Germany
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Schittkowski, K. (December 1, 1985). "A Unified Outline of Nonlinear Programming Algorithms." ASME. J. Mech., Trans., and Automation. December 1985; 107(4): 449–453. https://doi.org/10.1115/1.3260744
Download citation file:
- Ris (Zotero)
- Reference Manager
Get Email Alerts
When, Why, and How Can Derivative-Free Optimization Be Useful to Computational Engineering Design?
J. Mech. Des (January 2020)
A Machine Learning Enabled Multi-Fidelity Platform for the Integrated Design of Aircraft Systems
J. Mech. Des (December 2019)