Polynomial primal-dual cone affine scaling for semidefinite programming

DOI10.1016/S0168-9274(98)00100-7zbMath0956.90025OpenAlexW2138549351MaRDI QIDQ1294555

Arjan B. Berkelaar, Jos F. Sturm, Shu-Zhong Zhang

Publication date: 29 June 1999

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(98)00100-7

zbMATH Keywords

semidefinite programmingprimal-dual interior point methodsaffine scaling

Mathematics Subject Classification ID

Semidefinite programming (90C22) Numerical methods involving duality (49M29) Interior-point methods (90C51)

Related Items (3)

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ Similarity and other spectral relations for symmetric cones ⋮ Symmetric primal-dual path-following algorithms for semidefinite programming

Uses Software

• SDPHA

Cites Work

• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Conical projection algorithms for linear programming
• A primal projective interior point method for linear programming
• Superlinear convergence of interior-point algorithms for semidefinite programming
• Affine scaling algorithm fails for semidefinite programming
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Interior point techniques in optimization. Complementarity, sensitivity and algorithms
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
• Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• A new variant of the primal affine scaling algorithm for linear programs
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On the Nesterov--Todd Direction in Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• On sensitivity of central solutions in semidefinite programming

This page was built for publication: Polynomial primal-dual cone affine scaling for semidefinite programming