A new proof of the strong duality theorem for semidefinite programming
From MaRDI portal
Recommendations
- Strong Duality for Semidefinite Programming
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Strong duality conditions in semidefinite programming
- scientific article; zbMATH DE number 5036103
- Solving semidefinite programs via discretization method for solving semiinfinite programming problems
Cites work
- A note on an implementation of a method for quadratic semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- Discretization in semi-infinite programming: the rate of convergence
- scientific article; zbMATH DE number 1845876 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Programming
Cited in
(6)- A new duality for semidefinite multiplicative programming
- scientific article; zbMATH DE number 3936956 (Why is no real title available?)
- Strong Duality for Semidefinite Programming
- Solving semidefinite programs via discretization method for solving semiinfinite programming problems
- scientific article; zbMATH DE number 5036103 (Why is no real title available?)
- Strong duality conditions in semidefinite programming
This page was built for publication: A new proof of the strong duality theorem for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771002)