Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming
In this paper, we describe how to reformulate a problem that has second-order cone and/or semidefiniteness constraints in order to solve it using a general-purpose interior-point algorithm for nonlinear programming. The resulting problems are smooth and convex, and numerical results from the DIMACS Implementation Challenge problems and SDPLib are provided.
Unable to display preview. Download preview PDF.