Mehrotra predictor–corrector method: Difference between revisions

Content deleted Content added
{{math-stub}} It will be nice if more detail is added. See gradient descent for an example.
Marcol (talk | contribs)
Clarify the idea of predictor-corrector
Line 1:
'''Mehrotra's predictor-corrector method''' in [[optimization]] is an implementation of [[interior point method]]s. 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 stepsize that can be taken in this direction is used to evaluate how much centrality correction is needed. HenceSecond, a combinedcorrector term is computed: this contains both a centrality term and a second order term is computed (corrector).
 
Therefore, the search direction is the sum of the predictor direction and the corrector direction.
 
{{math-stub}}