Volume 51, Number 3, July-September 2017
|Page(s)||533 - 545|
|Published online||02 June 2017|
A full NT-step infeasible interior-point algorithm for semidefinite optimization
Department of Applied Mathematics, Faculty of Mathematical Science, Shahrekord University, P.O. Box 115, Shahrekord, Iran.
Received: 5 June 2015
Accepted: 14 June 2016
In this paper, a full Nesterov–Todd-step infeasible interior-point algorithm is presented for semidefinite optimization (SDO) problems. In contrast of some classical interior-point algorithms for SDO problems, this algorithm does not need to perform computationally expensive calculations for centering steps which are needed for classical interior-point methods. The convergence analysis of the algorithm is shown and it is also proved that the complexity bound of the algorithm coincides with the currently best iteration bound obtained by infeasible interior-point algorithms for this class of optimization problems.
Mathematics Subject Classification: 90C51 / 90C22
Key words: Semidefinite optimization / infeasible interior-point method / convergence analysis / polynomial complexity
© EDP Sciences, ROADEF, SMAI 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.