Jump to content

Mehrotra predictor–corrector method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Marcol (talk | contribs) at 12:39, 22 March 2005 (First stab at Mehrotra p-c algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Mehrotra's predictor-corrector method is an implementation of Interior point methods. It was proposed at the beginning of the '90 by Sanjay Mehrotra.

The idea is to first compute an optimizing search direction based on a first order term (predictor). The stepsize that can be taken in this direction is used to evaluate how much centrality correction is needed. Hence, a combined centrality term and second order term is computed (corrector).