A Primal-Dual Regularized Interior-Point Method for Semidefinite Programming

, et

référence BibTeX

Interior-point methods in semi-definite programming (SDP) require the solution of a sequence of linear systems which are used to derive the search directions. Safeguards are typically required in order to handle rank-deficient Jacobians and free variables. We propose a primal-dual regularization to the original SDP and show that it is possible to recover an optimal solution of the original SDP via inaccurate solves of a sequence of regularized SDPs for both the NT and dual HKM directions. This work is a generalization of recent work by Friedlander and Orban for quadratic programming.

, 29 pages

Axe de recherche

Application de recherche


, et
Optimization Methods and Software, 32(1), 193–219, 2017 référence BibTeX


G1212.pdf (590 Ko)