A simple variant of the Mizuno-Todd-Ye predictor-corrector algorithm and its objective-function-free complexity
DOI10.1137/110835475zbMATH Open1282.90095OpenAlexW2111340534MaRDI QIDQ2866211FDOQ2866211
Authors: Tomonari Kitahara, Takashi Tsuchiya 
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
Recommendations
- A modified predictor-corrector method for linear programming
- A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
- A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity
- Some variants of the Todd low-complexity algorithm
- Strict monotonicity in Todd's low-complexity algorithm for linear programming
interior point methoditeration complexitylinear programming problemstrong polynomialitylayered least squares interior point method
Cited In (5)
- What Tropical Geometry Tells Us about the Complexity of Linear Programming
- Some variants of the Todd low-complexity algorithm
- 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
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866211)
