A globally convergent algorithm for exact penalty functions

DOI10.1016/0377-2217(81)90097-7zbMath0454.90061OpenAlexW2057021453MaRDI QIDQ1149884

Jean-Bernard Lasserre

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90097-7

zbMATH Keywords

constrained optimizationcomputational resultsexact penalty functionsglobally convergent algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Smoothing approximation to the lower order exact penalty function for inequality constrained optimization, New simple exact penalty function for constrained minimization, On the smoothing of the square-root exact penalty function for inequality constrained optimization, A second-order smooth penalty function algorithm for constrained optimization problems, Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems, An objective penalty function method for nonlinear programming., Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On the global stabilization of locally convergent algorithms
• A globally convergent method for nonlinear programming
• Algorithms for some minimax problems
• Exact penalty functions in nonlinear programming
• Necessary and sufficient conditions for a penalty method to be exact
• Non-Linear Programming Via Penalty Functions
• An Exact Potential Method for Constrained Maxima
• Constrained Optimization Using a Nondifferentiable Penalty Function
• Exact penalty functions in nonlinear programming