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 qualificationmultiobjective programsdifferentiable convex functionsKarush-Kuhn- Tucker conditionset of strong Pareto optima

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

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

Cited in

(18)

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

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)