Jump to content

Mehrotra predictor–corrector method

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 00:57, 15 April 2005 (stepsize -- > step size (looks a bit better this way, even if optimization people cannot abstain optimizing away the white space in between)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Mehrotra's predictor-corrector method in optimization is an implementation of interior point methods. It was proposed in 1991 by Sanjay Mehrotra.

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

Therefore, the search direction is the sum of the predictor direction and the corrector direction.

Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Mehrotra_predictor–corrector_method&oldid=17303224"