A constraint qualification for convex programming

DOI10.1007/BF02671125zbMath0968.90056OpenAlexW146694888MaRDI QIDQ1594859

Shizheng Li

Publication date: 23 September 2001

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

constraint qualificationnondifferential convex programming

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)

Related Items (1)

Duality gap of the conic convex constrained optimization problems in normed spaces

Cites Work

• Unnamed Item
• A new constraint qualification condition
• Geometry of optimality conditions and constraint qualifications: The convex case
• Necessary and sufficient conditions for regularity of constraints in convex programming
• Geometry of optimality conditions and constraint qualifications

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