Necessary and sufficient conditions for regularity of constraints in convex programming

DOI10.1080/02331939208843830zbMath0817.90077MaRDI QIDQ4327951

Shizheng Li

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843830

zbMATH Keywords

necessary and sufficient conditions; directional derivatives; epigraph; nondifferentiable convex programming; outer normal cones; weakest constraint qualifications

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

Related Items

A constraint qualification for convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularity conditions for constrained extremum problems
• A new constraint qualification condition
• Regularizing the abstract convex program
• Optimality conditions for nondifferentiable convex semi-infinite programming
• An optimality condition for a nondifferentiable convex program
• Saddlepoints for convex programming in order vector spaces
• Geometry of optimality conditions and constraint qualifications: The convex case
• Characterizations of optimality without constraint qualification for the abstract convex program
• Geometry of optimality conditions and constraint qualifications
• Convex Analysis
• A Necessary and Sufficient Qualification for Constrained Optimization