On Polynomiality of a Predictor-Corrector Variant Algorithm
R. De Almeida, F. Bastos, Ana Paula Teixeira, Theodore E. Simos, George Psihoyios, Ch. Tsitouras · AIP conference proceedings · 2010
In this work we discuss the polynomiality of a feasible version of a Mehrotra’s predictor‐corrector variant algorithm. We prove that this algorithm will terminate after at most O(n4|log(ε)|) iterations.