Abstract.
In this paper, we present a nonlinear programming algorithm for solving semidefinite programs (SDPs) in standard form. The algorithm's distinguishing feature is a change of variables that replaces the symmetric, positive semidefinite variable X of the SDP with a rectangular variable R according to the factorization X=RR T. The rank of the factorization, i.e., the number of columns of R, is chosen minimally so as to enhance computational speed while maintaining equivalence with the SDP. Fundamental results concerning the convergence of the algorithm are derived, and encouraging computational results on some large-scale test problems are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 22, 2001 / Accepted: August 30, 2002 Published online: December 9, 2002
Key Words. semidefinite programming – low-rank factorization – nonlinear programming – augmented Lagrangian – limited memory BFGS
This research was supported in part by the National Science Foundation under grants CCR-9902010, INT-9910084, CCR-0203426 and CCR-0203113
Rights and permissions
About this article
Cite this article
Burer, S., Monteiro, R. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program., Ser. B 95, 329–357 (2003). https://doi.org/10.1007/s10107-002-0352-8
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0352-8