Théorie de la pénalisation exacte

DOI10.1051/m2an/1990240201971zbMath0752.65051OpenAlexW2275558294MaRDI QIDQ4712727

Joseph Frédéric Bonnans

Publication date: 25 June 1992

Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193594

zbMATH Keywords

constrained optimizationexact penalty functionsweak second-order sufficient conditionsglobalization of algorithmsnormality theory

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second-order and related extremality conditions in nonlinear programming
• A new constraint qualification condition
• A globally convergent method for nonlinear programming
• On the stability of sets defined by a finite number of equalities and inequalities
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
• Exact penalty functions and stability in locally Lipschitz programming
• Asymptotic Admissibility of the Unit Stepsize in Exact Penalty Methods
• Exact penalty functions in nonlinear programming
• Sufficient conditions for a globally exact penalty function without convexity
• Necessary and sufficient conditions for a penalty method to be exact
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• A lower bound for the controlling parameters of the exact penalty functions
• A New Approach to Lagrange Multipliers
• Second Order Conditions for Constrained Minima
• An Exact Potential Method for Constrained Maxima
• Convex Analysis
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming

This page was built for publication: Théorie de la pénalisation exacte