|
Abstract
|
In this paper, we propose a new primal-dual path-following interior-point method for
semidefinite optimization based on a new reformulation of the nonlinear equation of
the system which defines the central path. The proposed algorithm takes only full Nesterov
and Todd steps and therefore no line-searches are needed for generating the new
iterations. The convergence of the algorithm is established and the complexity result
coincides with the best-known iteration bound for semidefinite optimization problems.
|