Superlinear convergence of the affine scaling algorithm
From MaRDI portal
Publication:2365345
Recommendations
Cites work
- A Low Complexity Interior-Point Algorithm for Linear Programming
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A simplified global convergence proof of the affine scaling algorithm
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An implementation of Karmarkar's algorithm for linear programming
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Determining the interior point of a system of linear inequalities
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- scientific article; zbMATH DE number 4202017 (Why is no real title available?)
- scientific article; zbMATH DE number 3625108 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 515933 (Why is no real title available?)
- scientific article; zbMATH DE number 4197741 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- On the convergence of the affine-scaling algorithm
- Quadratic Convergence in a Primal-Dual Method
- Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
- Todd's low-complexity algorithm is a predictor-corrector path-following method
- Two-thirds is sharp for affine scaling
Cited in
(12)- On the convergence of the affine-scaling algorithm
- A simplified global convergence proof of the affine scaling algorithm
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- Superlinear primal-dual affine scaling algorithms for LCP
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- Generalized affine scaling algorithms for linear programming problems
- On the symmetric affiine scaling algorithm for line programming*
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Two-thirds is sharp for affine scaling
- The _1 solution of linear inequalities
This page was built for publication: Superlinear convergence of the affine scaling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365345)
