Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems

DOI10.1007/BF02192140zbMath0840.90101OpenAlexW1972536185MaRDI QIDQ1904697

Takashi Tsuchiya

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

zbMATH Keywords

interior-point methodslocal analysisIri-Imai algorithmquadratic convergence under degeneracy

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

Superlinear convergence of the affine scaling algorithm ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A multiplicative barrier function method for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Local Convergence Properties of New Methods in Linear Programming
• EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING
• Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems

This page was built for publication: Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems