Abstract.
In Part I of this series of articles, we introduced a general framework of exploiting the aggregate sparsity pattern over all data matrices of large scale and sparse semidefinite programs (SDPs) when solving them by primal-dual interior-point methods. This framework is based on some results about positive semidefinite matrix completion, and it can be embodied in two different ways. One is by a conversion of a given sparse SDP having a large scale positive semidefinite matrix variable into an SDP having multiple but smaller positive semidefinite matrix variables. The other is by incorporating a positive definite matrix completion itself in a primal-dual interior-point method. The current article presents the details of their implementations. We introduce new techniques to deal with the sparsity through a clique tree in the former method and through new computational formulae in the latter one. Numerical results over different classes of SDPs show that these methods can be very efficient for some problems.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 18, 2001 / Accepted: May 31, 2001 Published online: October 9, 2002
RID="⋆"
ID="⋆"The author was supported by The Ministry of Education, Culture, Sports, Science and Technology of Japan.
Key Words. semidefinite programming – primal-dual interior-point method – matrix completion problem – clique tree – numerical results
Mathematics Subject Classification (2000): 90C22, 90C51, 05C50, 05C05
Rights and permissions
About this article
Cite this article
Nakata, K., Fujisawa, K., Fukuda, M. et al. Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. Math. Program., Ser. B 95, 303–327 (2003). https://doi.org/10.1007/s10107-002-0351-9
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0351-9