It has been shown in various papers that most interior-point algorithms and their analysis can be generalized to semidefinite optimization. This paper presents an extension of the recent variant of Mehrotra's predictor-corrector algorithm that was proposed by Salahi et al. (2005) for linear optimization problems. Based on the NT (Nesterov and Todd 1997) direction as Newton search direction it is shown that the iteration-complexity bound of the algorithm is of the same order as that of the corresponding algorithm for linear optimization.
AdvOL-report \#2007 /04. McMaster U. Hamilton, Ontario, Canada. http://optlab.mcmaster.ca/component/option,com_docman/task,doc_download/gid,109/Itemid,92/