A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
From MaRDI portal
Publication:2465563
DOI10.1007/S11590-006-0038-XzbMATH Open1147.90038OpenAlexW2152970697MaRDI QIDQ2465563FDOQ2465563
Authors: V. 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
Recommendations
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- Linear Matrix Inequalities in System and Control Theory
- Semidefinite Programming
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- An exact duality theory for semidefinite programming and its complexity implications
- Semidefinite optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Generalizations of Slater's constraint qualification for infinite convex programs
- A simple closure condition for the normal cone intersection formula
- Semidefinite programming duality and linear time-invariant systems
- Strong Duality for Semidefinite Programming
- Necessary and sufficient conditions for stable conjugate duality
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Semidefinite programming
- The strong conical hull intersection property for convex programming
- Fenchel duality and the strong conical hull intersection property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Investigating duality on stability conditions
Cited In (15)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- On approximate solutions for robust convex semidefinite optimization problems
- Strong duality conditions in semidefinite programming
- Strong duality in robust semi-definite linear programming under data uncertainty
- An exact explicit dual for the linear copositive programming problem
- Generalized robust duality in constrained nonconvex optimization
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Duality for nonsmooth semi-infinite programming problems
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- OPTIMAL CONTROL OF SEMILINEAR HIGHER-ORDER DIFFERENTIAL INCLUSIONS
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Title not available (Why is that?)
This page was built for publication: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465563)
