Affine scaling algorithm fails for semidefinite programming
type: Item
instance of: scholarly article
title: Affine scaling algorithm fails for semidefinite programming
zbMATH Open document ID: 0920.90099
DOI: 10.1007/BF02680567
author: Masakazu Muramatsu
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1294716
zbMATH Keywords: global convergence analysis
zbMATH Keywords: affine scaling
zbMATH Keywords: semidefinite programming
MaRDI profile type: Publication
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Q4327459
cites work: Complementarity and nondegeneracy in semidefinite programming
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: Q5583564
cites work: On a Matrix Generalization of Affine-Scaling Vector Fields
cites work: Q4312998
cites work: Interior Point Trajectories in Semidefinite Programming
cites work: An Interior-Point Method for Semidefinite Programming
cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
cites work: A new polynomial-time algorithm for linear programming
cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
cites work: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
cites work: The Affine Scaling Algorithm Fails for Stepsize 0.999
cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming
cites work: A simplified global convergence proof of the affine scaling algorithm
cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
cites work: Primal-dual affine-scaling algorithms fail for semidefinite programming
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: Q3496152
cites work: A simple proof of a primal affine scaling method
cites work: Q4859839
cites work: A note on Mascarenhas' counterexample about global convergence of the affine scaling algorithm
cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
cites work: A primal-dual potential reduction method for problems involving matrix inequalities
cites work: Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program
cites work: A modification of Karmarkar's linear programming algorithm
cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
description: scientific article; zbMATH DE number 1294716