Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
From MaRDI portal
Publication:1904697
Recommendations
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- Quadratic Convergence in a Primal-Dual Method
- Local convergence of the neighborhood-following algorithm for linear programming under degenerate cases
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
Cites work
- scientific article; zbMATH DE number 4089320 (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 multiplicative barrier function method for linear programming
- A new polynomial-time algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Local Convergence Properties of New Methods in Linear Programming
Cited in
(5)- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- Local convergence of the neighborhood-following algorithm for linear programming under degenerate cases
- Value estimation approach to the Iri-Imai method for constrained convex optimization
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
- Superlinear convergence of the affine scaling algorithm
This page was built for publication: Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904697)
