A finite termination Mehrotra-type predictor-corrector algorithm

Mehrotra-type predictor-corrector algorithms are the backbone of most Interior Point Methods based software packages. Salahi et al. [M. Salahi, J. Peng, T. Terlaky, On Mehrotra-type predictor-corrector algorithms, Technical Report 2005/4, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada. http://www.cas.mcmaster. ca/similar to oplab/publication] in their recent works have shown some ill behaviors of Mehrotra's original algorithm which motivated them to modify it in order to achieve the polynomial iteration complexity while preserving its practical efficiency. In this paper we analyze the same algorithm from a different perspective and give a condition on the maximum feasible step size in the predictor step, violation of which might lead to a very small or even zero step size in the corrector step. If the maximum step size in the predictor step is above a certain threshold, then we cut it to satisfy the derived condition. This enables us to prove that the algorithm terminates finitely. C 2007 Elsevier Inc. All rights reserved.