Strong duality conditions in semidefinite programming
From MaRDI portal
Recommendations
- Strong Duality for Semidefinite Programming
- scientific article; zbMATH DE number 1552283
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- A new proof of the strong duality theorem for semidefinite programming
- scientific article; zbMATH DE number 5036103
Cited in
(24)- A new proof of the strong duality theorem for semidefinite programming
- Strong duality and minimal representations for cone optimization
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- On strong duality in linear copositive programming
- Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction
- Sequences with minimal time-frequency uncertainty
- A refined theorem concerning the conditioning of semidefinite programs
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Controller design and value function approximation for nonlinear dynamical systems
- Semidefinite approximations of projections and polynomial images of semialgebraic sets
- Theoretical and algorithmic aspects in semi-definite optimization
- Strong Duality for Semidefinite Programming
- Lebesgue decomposition in action via semidefinite relaxations
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- An improved semidefinite programming hierarchy for testing entanglement
- scientific article; zbMATH DE number 5036103 (Why is no real title available?)
- Strong duality in lasserre's hierarchy for polynomial optimization
- A hierarchy of spectral relaxations for polynomial optimization
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Lagrangian duality in convex conic programming with simple proofs
- Linear semidefinite programming problems: regularisation and strong dual formulations
- Path-based DEA models in multiplier form and returns-to-scale analysis
- Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
This page was built for publication: Strong duality conditions in semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5476574)
