Polynomial time solvability of non-symmetric semidefinite programming

DOI10.1016/j.orl.2010.07.009zbMath1202.90208OpenAlexW2083304322MaRDI QIDQ613324

Sheng-Long Hu, Zheng-Hai Huang

Publication date: 20 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.07.009

zbMATH Keywords

interior point methodpolynomial timenon-symmetric semidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• Smoothing algorithms for complementarity problems over symmetric cones
• On cone of nonsymmetric positive semidefinite matrices
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• Euclidean Jordan algebras and interior-point algorithms
• Dual versus primal-dual interior-point methods for linear and conic programming
• Lectures on Modern Convex Optimization
• Semidefinite optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• A Jordan-algebraic approach to potential-reduction algorithms