A finite termination mehrotra-type predictor-corrector algorithm for Semidefinite Optimization

Mehrotra-type predictor-corrector algorithm is one of the most remarkable interior-point methods for linear optimization, and it is also the base of many interior-point methods software packages. This paper presents an extension of the recent variant of Mehrotra´s predictor-corrector algorithm that was proposed by Salahi (2007) for linear optimization problems. Based on the NT direction as Newton search direction, the finite termination of the algorithm for Semidefinite Optimization is proved, that is analogous to the linear case.