A proof of the polynomiality of the Iri-Imai method
From MaRDI portal
Publication:1260658
DOI10.1006/JCOM.1993.1018zbMath0811.90066OpenAlexW1991904536MaRDI QIDQ1260658
Publication date: 24 August 1993
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1993.1018
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Linear programming (90C05)
Related Items (6)
Convergence property of the Iri-Imai algorithm for some smooth convex programming problems ⋮ Potential reduction method for harmonically convex programming ⋮ New complexity results for the Iri-Imai method ⋮ A class of polynomial variable metric algorithms for linear optimization ⋮ Value estimation approach to the Iri-Imai method for constrained convex optimization ⋮ Degeneracy in interior point methods for linear programming: A survey
This page was built for publication: A proof of the polynomiality of the Iri-Imai method
