Calmness in optimization problems with equality constraints

DOI10.1006/JMAA.1995.1032MaRDI QIDQ1842072zbMATH OpenOpenAlexFDO

Authors Simon Di, R. A. Poliquin

Publication date 11 August 1996

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

Full work available at URL https://doi.org/10.1006/jmaa.1995.1032

zbMATH Keywords

calmnessequality constraintslocal solutionsoptimization

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonlinear programming (90C30)

Review text

The paper is devoted to the study of the calmness condition, first introduced by \textit{F. H. Clarke} [Math. Oper. Res. 1, 165-173 (1976; Zbl 0404.90100)] (this condition is one of the weakest constraint qualifications). First, the authors give two counterexamples to illustrate that an optimization problem with equality constraints need not be calm almost everywhere. Then, some conditions are presented that insure calmness at local solutions and also conditions that insure that a problem is calm at local solutions almost everywhere.

Recommendations

• Calmness of constraint systems with applications
• Calm minima in parameterized finite-dimensional optimization
• Calmness and Exact Penalization
• Calmness and exact penalization in vector optimization with cone constraints
• On the Calmness of a Class of Multifunctions

Cited in

(5)

• The effect of calmness on the solution set of systems of nonlinear equations
• Exactness and algorithm of an objective penalty function
• Calmness of constraint systems with applications
• Calm minima in parameterized finite-dimensional optimization
• Calmness of efficient solution maps in parametric vector optimization

This page was built for publication: Calmness in optimization problems with equality constraints

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