A Simple Variant of the Mizuno--Todd--Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity
From MaRDI portal
Publication:2866211
DOI10.1137/110835475zbMath1282.90095OpenAlexW2111340534MaRDI QIDQ2866211
Takashi Tsuchiya, Tomonari Kitahara
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/efd8943c7b2c033a6f097e8f61e7984219d1cd0c
interior point methodlinear programming problemiteration complexitystrong polynomialitylayered least squares interior point method
Related Items (4)
Log-Barrier Interior Point Methods Are Not Strongly Polynomial ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy ⋮ What Tropical Geometry Tells Us about the Complexity of Linear Programming ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
This page was built for publication: A Simple Variant of the Mizuno--Todd--Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity
