Affine scaling algorithm fails for semidefinite programming

Related Items

Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems, An admissible dual internal point method for a linear semidefinite programming problem, A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming, Numerical experiments with universal barrier functions for cones of Chebyshev systems, Polynomial primal-dual cone affine scaling for semidefinite programming

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A modification of Karmarkar's linear programming algorithm
A new polynomial-time algorithm for linear programming
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
A simplified global convergence proof of the affine scaling algorithm
Complementarity and nondegeneracy in semidefinite programming
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
A note on Mascarenhas' counterexample about global convergence of the affine scaling algorithm
A simple proof of a primal affine scaling method
A primal-dual potential reduction method for problems involving matrix inequalities
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
A variation on Karmarkar’s algorithm for solving linear programming problems
The Affine Scaling Algorithm Fails for Stepsize 0.999
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
Interior Point Trajectories in Semidefinite Programming
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Primal--Dual Path-Following Algorithms for Semidefinite Programming
Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm 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
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program
On a Matrix Generalization of Affine-Scaling Vector Fields
Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
An Interior-Point Method for Semidefinite Programming