a1 Department of Mathematics, Azarbaijan University of Tarbiat Moallem, Tabriz, Iran (email: email@example.com)
We introduce a full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular function to provide the feasibility step and to measure proximity to the central path. The result of polynomial complexity coincides with the best known iteration bound for infeasible interior-point methods.
(Received July 05 2011)
(Revised December 28 2011)
2010 Mathematics subject classification
Keywords and phrases