Method of approximate centers for semi-definite programming

DOI10.1080/10556789708805658zbMath0879.90142OpenAlexW2016493444MaRDI QIDQ4345241

Cornelis Roos, Tamás Terlaky, Etienne de Klerk, Bing-sheng He

Publication date: 23 July 1997

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789708805658

zbMATH Keywords

semi-definite programminginterior point algorithmspath-following algorithmlarge-scale linear programmingapproximate centers

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

A long-step primal-dual path-following method for semidefinite programming

Uses Software

• SDPHA

Cites Work

• A polynomial method of approximate centers for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On a Matrix Generalization of Affine-Scaling Vector Fields
• Semidefinite Programming