A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
From MaRDI portal
(Redirected from Publication:2465563)
Recommendations
Cites work
- scientific article; zbMATH DE number 1303653 (Why is no real title available?)
- scientific article; zbMATH DE number 1552283 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- A simple closure condition for the normal cone intersection formula
- An exact duality theory for semidefinite programming and its complexity implications
- Fenchel duality and the strong conical hull intersection property
- Generalizations of Slater's constraint qualification for infinite convex programs
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Investigating duality on stability conditions
- Linear Matrix Inequalities in System and Control Theory
- Necessary and sufficient conditions for stable conjugate duality
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Semidefinite Programming
- Semidefinite optimization
- Semidefinite programming
- Semidefinite programming duality and linear time-invariant systems
- Strong Duality for Semidefinite Programming
- The strong conical hull intersection property for convex programming
Cited in
(15)- scientific article; zbMATH DE number 1552283 (Why is no real title available?)
- 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
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Generalized robust duality in constrained nonconvex optimization
- 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
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)
