A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions

DOI10.1007/s11590-006-0038-xzbMath1147.90038MaRDI QIDQ2465563

Vaithilingam Jeyakumar

Publication date: 4 January 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-006-0038-x

zbMATH Keywords

convex programming; semidefinite optimization; strong duality; constraint qualifications

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C25: Convex programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

Strong duality in robust semi-definite linear programming under data uncertainty, New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs, Duality for nonsmooth semi-infinite programming problems, Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Constraint qualifications characterizing Lagrangian duality in convex optimization

Cites Work

• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Generalizations of Slater's constraint qualification for infinite convex programs
• An exact duality theory for semidefinite programming and its complexity implications
• Semidefinite programming
• Fenchel duality and the strong conical hull intersection property
• The strong conical hull intersection property for convex programming
• Necessary and sufficient conditions for stable conjugate duality
• Investigating duality on stability conditions
• A new geometric condition for Fenchel's duality in infinite dimensional spaces
• Semidefinite optimization
• Linear Matrix Inequalities in System and Control Theory
• Strong Duality for Semidefinite Programming
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• A simple closure condition for the normal cone intersection formula
• Semidefinite Programming
• Semidefinite programming duality and linear time-invariant systems
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item