The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight

DOI10.1007/978-3-030-12119-8_6zbMath1421.90083OpenAlexW2914757914MaRDI QIDQ2325239

Murat Mut, Tamás Terlaky

Publication date: 9 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-12119-8_6

zbMATH Keywords

complexitypolytopescurvatureinterior-point methodslinear optimizationcentral path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)

This page was built for publication: The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight