On penalty function methods for nonlinear programming problems

DOI10.1016/0022-247X(70)90009-0zbMath0198.24602MaRDI QIDQ2539953

David M. Ryan, Michael R. Osborne

Publication date: 1970

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

operations research

Related Items (6)

A class of generalized variable penalty methods for nonlinear programming ⋮ Variable penalty methods for constrained minimization ⋮ An improved variable penalty algorithm for automated structural design ⋮ The `lethargy' theorem - a property of approximation by \(\gamma\)- polynomials ⋮ Minimization methods with constraints ⋮ A hybrid variable penalty method for nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• A constructive proof of the Kuhn-Tucker multiplier rule
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems

This page was built for publication: On penalty function methods for nonlinear programming problems