AN INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE LEAST-SQUARES PROBLEMS

We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter beta which defines the size of the neighborhood of the central-path and of the parameter theta which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined and converges to the optimal solution of SDLS. Moreover, we obtain the currently best known iteration bound for the algorithm with a short-update method, namely, O (root n log(n/epsilon)). Finally, we report some numerical results to illustrate the efficiency of our proposed algorithm.