Penalty function versus non-penalty function methods for constrained nonlinear programming problems

DOI10.1007/BF01584087zbMATH Open0242.90051MaRDI QIDQ5653813FDOQ5653813

Garth P. McCormick

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• `` Direct Search Solution of Numerical and Statistical Problems
• A Simplex Method for Function Minimization
• Title not available (Why is that?)
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Cutting-Plane Method for Solving Convex Programs
• Title not available (Why is that?)
• Optimization by Least Squares
• Newton's method for convex programming and Tschebyscheff approximation
• The \(\Omega\)-stability theorem for flows
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Title not available (Why is that?)
• Extensions of Lagrange Multipliers in Nonlinear Programming
• Surrogate Mathematical Programming
• A New Method of Constrained Optimization and a Comparison With Other Methods
• Title not available (Why is that?)
• Lagrange multipliers and nonlinear programming
• Generalized Polynomial Optimization
• An Exact Potential Method for Constrained Maxima
• The Generalized Penalty-Function/Surrogate Model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremization of functions with equality constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Method for Constrained Optimization Problems
• Title not available (Why is that?)
• The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex programming by tangential approximation
• A Ricocheting Gradient Method for Nonlinear Optimization
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• A geometric method in nonlinear programming
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives
• Minimization methods with constraints
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
• A quadratically-convergent algorithm for general nonlinear programming problems
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• A globally and quadratically convergent algorithm for general nonlinear programming problems
• On the global and superlinear convergence of a discretized version of Wilson's method
• Computational experience in sensitivity analysis for nonlinear programming

This page was built for publication: Penalty function versus non-penalty function methods for constrained nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653813)