A new proof of the strong duality theorem for semidefinite programming

DOI10.1016/j.jmaa.2004.08.063zbMath1079.90151OpenAlexW2070126296MaRDI QIDQ1771002

Qingzhi Yang

Publication date: 7 April 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.08.063

zbMATH Keywords

DualitySemidefinite programmingDiscretizationSemiinfinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)

Cites Work

• Unnamed Item
• A note on an implementation of a method for quadratic semi-infinite programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• An implementation of a discretization method for semi-infinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• Discretization in semi-infinite programming: the rate of convergence

This page was built for publication: A new proof of the strong duality theorem for semidefinite programming