Revision as of 00:30, 8 February 2006 edit Jitse Niesen (talk \| contribs) Extended confirmed users 17,194 edits change cat and stub type ← Previous edit		Revision as of 05:11, 23 February 2006 edit undo Mathbot (talk \| contribs) Bots 479,804 edits Robot-assisted spelling. See User:Mathbot/Logged misspellings for changes. Next edit →
Line 5: Therefore, the search direction is the sum of the predictor direction and the corrector direction. ~~Althought~~Although there is no theoretical complexity bound on it yet, Mehrotra's predictor-corrector method is widely used in practice. Its corrector step effectively uses the [[Cholesky decomposition]] of the linear system in the predictor step. Thus it has very little overhead. It also appears to converge very fast when close to the optimum.

Mehrotra predictor–corrector method: Difference between revisions