Affine scaling algorithm fails for semidefinite programming
From MaRDI portal
(Redirected from Publication:1290670)
Recommendations
- Primal-dual affine-scaling algorithms fail for semidefinite programming
- The Affine Scaling Algorithm Fails for Stepsize 0.999
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- Polynomial primal-dual affine scaling algorithms in semidefinite programming
Cites work
- scientific article; zbMATH DE number 4170639 (Why is no real title available?)
- scientific article; zbMATH DE number 686914 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- scientific article; zbMATH DE number 830380 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A note on Mascarenhas' counterexample about global convergence of the affine scaling algorithm
- A primal-dual potential reduction method for problems involving matrix inequalities
- A simple proof of a primal affine scaling method
- A simplified global convergence proof of the affine scaling algorithm
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- An Interior-Point Method for Semidefinite Programming
- Complementarity and nondegeneracy in semidefinite programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Trajectories in Semidefinite Programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On a Matrix Generalization of Affine-Scaling Vector Fields
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-dual affine-scaling algorithms fail for semidefinite programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- The Affine Scaling Algorithm Fails for Stepsize 0.999
Cited in
(6)- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- An admissible dual internal point method for a linear semidefinite programming problem
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
- Primal-dual affine-scaling algorithms fail for semidefinite programming
- Polynomial primal-dual cone affine scaling for semidefinite programming
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
This page was built for publication: Affine scaling algorithm fails for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290670)
