Author/Authors :
Mansouri، H. نويسنده Department of Applied Mathematics, Shahrekord University, P.O. Box 115, Shahrekord, Iran. , , Siyavash، T. نويسنده Department of Applied Mathematics, Shahrekord University, P.O. Box 115, Shahrekord, Iran. , , Zangiabadi، M. نويسنده Department of Applied Mathematics, Shahrekord University, P.O. Box 115, Shahrekord, Iran. ,
Abstract :
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT steps, namely $O(n*log(n/\epsilon))$, which is as good as the linear analogue.
