Revision as of 12:43, 22 March 2005 edit Marcol (talk \| contribs) 504 edits No edit summary ← Previous edit		Revision as of 13:40, 22 March 2005 edit undo Charles Matthews (talk \| contribs) Autopatrolled, Administrators 367,800 edits m cats Next edit →
Line 1: '''Mehrotra's predictor-corrector method''' in [[optimization]] is an implementation of [[~~Interior_point_method\|~~interior point methods]]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. Hence, a combined centrality term and second order term is computed (corrector). [[Category:Algorithms]][[Category:Optimization]]

Mehrotra predictor–corrector method: Difference between revisions