Quadratic Convergence in a Primal-Dual Method
Published Online:1 Aug 1993https://doi.org/10.1287/moor.18.3.741
Abstract
We show that the Mizuno-Todd-Ye O(√nL) iteration predictor-corrector primal-dual interior-point algorithm for linear programming is quadratically convergent. Our proof does not assume that the problems be nondegenerate. We do not assume that the iterate generated by the algorithm be convergent, an assumption common to all previous asymptotic convergence analysis.
