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

DOI10.1007/978-3-030-12119-8_6MaRDI QIDQ2325239zbMATH OpenOpenAlexFDO

Authors 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

complexityinterior-point methodspolytopescurvaturecentral pathlinear optimization

Mathematics Subject Classification ID

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

Recommendations

• A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming

Cited in

(2)

• A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325239)