A new constraint qualification condition
From MaRDI portal
We introduce a new constraint qualification condition in mathematical programming which encompasses the Mangasarian-Fromovitz's condition and the constant rank condition of Janin. Contrarily to the Mangasarian- Fromovitz's condition, our condition is still satisfied when one translates equalities as double inequalities. It relies on the fact that linearization stability is easier to check with equalities than with inequalities.
Recommendations
Cites work
- A Necessary and Sufficient Qualification for Constrained Optimization
- An algorithmic approach to nonlinear analysis and optimization
- Constraint Qualifications Revisited
- Directional derivative of the marginal function in nonlinear programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Geometry of optimality conditions and constraint qualifications
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 3496455 (Why is no real title available?)
- Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
- On regularity conditions in mathematical programming
- Programmes linéaires d'appui d'un programme convexe, application aux conditions d'optimalité et à la dualité
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Sur les programmes convexes definis dans des espaces vectoriels topologiques
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The Generic Nature of Optimality Conditions in Nonlinear Programming
Cited in
(12)- Regularity conditions for constrained extremum problems via image space
- A constraint qualification for convex programming
- A necessary and sufficient condition for unique skill assessment
- Constraint qualification failure in action
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Necessary and sufficient conditions for regularity of constraints in convex programming
- A necessary and a sufficient optimality condition for bilevel programming problems
- Théorie de la pénalisation exacte
- A reduced Hessian SQP method for inequality constrained optimization
- Constant-rank condition and second-order constraint qualification
- On the image regularity condition.
- On relaxing the Mangasarian-Fromovitz constraint qualification
This page was built for publication: A new constraint qualification condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057189)
