It is shown that the Mizuno-Todd-Ye iteration predictor-corrector primal-dual interior-point algorithm for linear programming is quadratically convergent. The present proof does not assume that the problems be nondegenerate. It is not assumed that the iterate generated by the algorithm be convergent, an assumption common to all previous asymptotic convergence analysis.
