A simple constraint qualification in convex programming

DOI10.1007/BF01582159MaRDI QIDQ1315427zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 27 March 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582159

zbMATH Keywords

constraint qualificationdifferentiable convex functionsKarush-Kuhn- Tucker conditionmultiobjective programsset of strong Pareto optima

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Review text

The authors introduce a rather large class of differentiable convex functions for which the constraint qualifications is always satisfied. Hence, for programs with the constraints belonging to this class, consistency of the Karush-Kuhn-Tucker condition (as a system) is both necessary and sufficient for optimality. The authors give geometric and algebraic characterizations for this class of functions. In the multiobjective programs the authors proved that, for the same class of functions, the set of Pareto optima coincides with the set of strong Pareto optima.

Recommendations

• A necessary and sufficient constraint qualification for sufficient optimality conditions in differentiable programming
• A constraint qualification for convex programming
• scientific article; zbMATH DE number 4119966
• Optimality conditions and the basic constraint qualification for quasiconvex programming
• scientific article; zbMATH DE number 7270290

Cites work

• Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Geometry of optimality conditions and constraint qualifications: The convex case
• scientific article; zbMATH DE number 3711742 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Proper efficiency and the theory of vector maximization

Cited in

(18)

• A saddle-point characterization of Pareto optima
• LFS functions in multi-objective programming
• A constraint qualification for convex programming
• Partly convex programming and Zermelo's navigation problems
• A new algorithm for generalized fractional programs
• scientific article; zbMATH DE number 3850834 (Why is no real title available?)
• Convex minimization problems with weak constraint qualifications
• scientific article; zbMATH DE number 3900520 (Why is no real title available?)
• A simple constraint qualification in infinite dimensional programming
• scientific article; zbMATH DE number 4051368 (Why is no real title available?)
• Constraint qualifications in input optimisation
• Stable parametric programming^*
• scientific article; zbMATH DE number 605174 (Why is no real title available?)
• Necessary and sufficient conditions for regularity of constraints in convex programming
• scientific article; zbMATH DE number 4119966 (Why is no real title available?)
• A necessary and sufficient constraint qualification for sufficient optimality conditions in differentiable programming
• Transposition Theorems and Qualification‐Free Optimality Conditions
• A note on multiple optimality conditions for programs with convex inequality constraints

This page was built for publication: A simple constraint qualification in convex programming

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