Quadratic convergence in a primal-dual method

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)741-751
JournalMathematics of Operations Research
StatePublished - 1993


Dive into the research topics of 'Quadratic convergence in a primal-dual method'. Together they form a unique fingerprint.

Cite this