A relaxed cutting plane method for semi-infinite semi-definite programming

DOI10.1016/j.cam.2005.09.013zbMath1101.65063OpenAlexW1992358917MaRDI QIDQ2503018

Soon-Yi Wu, Kok Lay Teo, Sheng Jie Li, Xiao Qi Yang

Publication date: 13 September 2006

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.09.013

zbMATH Keywords

numerical examplesdiscretization algorithmcutting plane schemesemi-infinite and semi-definite programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Semi-infinite programming (90C34)

Related Items (1)

Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequality systems and optimization
• A ``build-down scheme for linear programming
• A build-up variant of the logarithmic barrier method for LP
• An adaptive dual parametrization algorithm for quadratic semi-infinite programming problems
• Semidefinite optimization
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• Strong Duality for Semidefinite Programming
• A solution method for combined semi-infinite and semi-definite programming
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A relaxed cutting plane method for semi-infinite semi-definite programming