Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
From MaRDI portal
Publication:1904697
DOI10.1007/BF02192140zbMATH Open0840.90101OpenAlexW1972536185MaRDI QIDQ1904697FDOQ1904697
Publication date: 4 July 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02192140
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
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A multiplicative barrier function method for linear programming
- A modification of Karmarkar's linear programming algorithm
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Local Convergence Properties of New Methods in Linear Programming
- EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING
Cited In (4)
- Superlinear convergence of the affine scaling algorithm
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
- Value estimation approach to the Iri-Imai method for constrained convex optimization
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)
