Polynomial time solvability of non-symmetric semidefinite programming

DOI10.1016/J.ORL.2010.07.009MaRDI QIDQ613324zbMATH OpenOpenAlexFDO

Authors Shenglong Hu, Zhenghai 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

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

Recommendations

• On the complexity of semidefinite programs
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On time complexity of semidefinite programs arising in polynomial optimization
• Semidefinite Programming
• Infeasible interior point method for semidefinite programs

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• A Jordan-algebraic approach to potential-reduction algorithms
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
• Dual versus primal-dual interior-point methods for linear and conic programming
• Euclidean Jordan algebras and interior-point algorithms
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• On cone of nonsymmetric positive semidefinite matrices
• Semidefinite optimization
• Smoothing algorithms for complementarity problems over symmetric cones
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming

Cited in

(2)

• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• On time complexity of semidefinite programs arising in polynomial optimization

This page was built for publication: Polynomial time solvability of non-symmetric semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613324)