A Newton algorithm for distributed Semi-Definite Programs using the primal-dual interior-point method

Paper in proceeding, 2015

This paper considers the problem of solving convex decomposable Semi-Definite Programs (SDPs) in a distributed fashion. The SDP subproblems are solved locally, while the constraints coupling the different local problems are introduced in the local cost functions using a Lagrange relaxation. The local problems are solved via the primal-dual interior-point method, taking steps along the Nesterov-Todd directions, while the feasibility of the coupling constraints is improved along the central path by taking Newton iterations on the multipliers associated to the Lagrange relaxation. The local factorisations involved in computing the Nesterov-Todd directions are re-used to construct gradients and Hessians for the Lagrange multipliers. The local factorisations are also re-used to construct linear predictors for both the local primal-dual variables and the multipliers, which improve significantly the tracking of the central path.