Polynomial primal-dual affine scaling algorithms in semidefinite programming

DOI10.1023/A:1009791827917MaRDI QIDQ1386485zbMATH OpenOpenAlexFDO

Authors E. de Klerk, C. Roos, Tamás Terlaky

Publication date 5 May 1999

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009791827917

zbMATH Keywords

semidefinite programmingprimal-dual methodinterior-point methodDikin stepsprimal-dual affine scaling algorithmsworst-case complexity bound

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
• Primal-dual affine-scaling algorithms fail for semidefinite programming
• A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
• Primal--Dual Path-Following Algorithms for Semidefinite Programming

Cited in

(6)

• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Primal-dual affine-scaling algorithms fail for semidefinite programming
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
• scientific article; zbMATH DE number 5564089 (Why is no real title available?)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization

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

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