RESEARCH PAPERS: Design Automation Papers

A Unified Outline of Nonlinear Programming Algorithms

[+] Author and Article Information
K. Schittkowski

Institut für Informatik, Universität Stuttgart, 7000 Stuttgart 1, West Germany

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


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.

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