Mehrotra predictor–corrector method: Difference between revisions

Revision as of 16:55, 8 February 2007

Revision as of 15:08, 11 February 2007

Line 3:

The method is based on the fact that at each [[iteration]] of an interior point algorithm it is necessary to compute the [[Cholesky decomposition]] (factorization) of a large matrix in order to find the search direction. The factorization step is the most computationally expensive step in the algorithm. Therefore it makes sense to use the same decomposition more than once before recomputing it.

At each iteration of the algorithm, Mehrotra's predictor-corrector method uses the same Cholesky decomposition to find two different directions: a predictor and a corrector.

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. SecondThen, a corrector term is computed: this contains both a centrality term and a second order term.

The complete search direction is the sum of the predictor direction and the corrector direction.