Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming

DOI10.1287/moor.24.1.149zbMath0977.90033OpenAlexW2121274191MaRDI QIDQ2757588

Masakazu Muramatsu, Robert J. Vanderbei

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/958282c5be66c99c853e0e8a5f9cecda633b1e96

zbMATH Keywords

global convergencesemidefinite programmingprimal-dual interior-point methodaffine-scaling algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (4)

The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction ⋮ Affine scaling algorithm fails for semidefinite programming ⋮ Polynomial primal-dual cone affine scaling for semidefinite programming ⋮ Generalized affine scaling algorithms for linear programming problems

Uses Software

• CSDP
• SDPA

This page was built for publication: Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming