Title of article :
New complexity analysis of a full Nesterov-Todd steps IIPM for semidefinite optimization
Author/Authors :
Mansouri، H. نويسنده Shahrekord University , , Zangiabadi، M. نويسنده Department of Applied Mathematics, Shahrekord University, P.O. Box 115, Shahrekord, Iran. ,
Issue Information :
دوفصلنامه با شماره پیاپی سال 2011
Abstract :
In [H. Mansouri and C. Roos, {\em Numer. Algorithms} {\bf 52} (2009) 225-255.], Mansouri and
Ross presented a primal-dual infeasible interior-point algorithm
with full-Newton steps whose iteration bound coincides with the
best known bound for infeasible interior-point methods. Here, we
introduce a slightly different algorithm with a different search
direction and show that the same complexity result is obtained
using a simpler analysis.
Journal title :
Bulletin of the Iranian Mathematical Society
Journal title :
Bulletin of the Iranian Mathematical Society
