Superlinear convergence of the affine scaling algorithm
From MaRDI portal
Publication:2365345
DOI10.1007/BF02592206zbMath0870.90083OpenAlexW2138449322MaRDI QIDQ2365345
Renato D. C. Monteiro, Takashi Tsuchiya
Publication date: 15 September 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592206
global convergenceinterior point algorithmssuperlinear convergencelong-step affine scaling algorithm
Related Items
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, Trust region affine scaling algorithms for linearly constrained convex and concave programs, The \(\ell_1\) solution of linear inequalities, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Generalized affine scaling algorithms for linear programming problems, On the symmetric affiine scaling algorithm for line programming*
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- Two-thirds is sharp for affine scaling
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- On the convergence of the affine-scaling algorithm
- Todd's low-complexity algorithm is a predictor-corrector path-following method
- A simplified global convergence proof of the affine scaling algorithm
- Determining the interior point of a system of linear inequalities
- An implementation of Karmarkar's algorithm for linear programming
- Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Quadratic Convergence in a Primal-Dual Method
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- A Low Complexity Interior-Point Algorithm for Linear Programming
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
