Duality for semi-definite and semi-infinite programming
From MaRDI portal
Publication:4467176
DOI10.1080/02331930310001611484zbMath1087.90082OpenAlexW2000336699MaRDI QIDQ4467176
Sheng Jie Li, Xiao Qi Yang, Kok Lay Teo
Publication date: 9 June 2004
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/42489
Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
On strong duality in linear copositive programming ⋮ Primal-dual interior-point algorithm for convex quadratic semi-definite optimization ⋮ Uniform LP duality for semidefinite and semi-infinite programming ⋮ \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications ⋮ Revisiting some rules of convex analysis ⋮ Optimality Conditions in Semidefinite Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Inequality systems and optimization
- Quadratic programming with one negative eigenvalue is NP-hard
- Conditioning of semidefinite programs
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Semi-Infinite Programming: Theory, Methods, and Applications
- Strong Duality for Semidefinite Programming
- Semidefinite Programming
- An Infinite Linear Program with a Duality Gap
- Handbook of semidefinite programming. Theory, algorithms, and applications