Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results

Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota

Research output: Contribution to journalArticle

83 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)303-327
Number of pages25
JournalMathematical Programming, Series B
Volume95
Issue number2
DOIs
Publication statusPublished - Feb 1 2003

Fingerprint

Matrix Completion
Semidefinite Program
Semidefinite Programming
Sparsity
Positive Semidefinite Matrix
Primal-dual Interior Point Method
Numerical Results
Positive definite matrix
Clique
Series
Semidefinite programming
Framework

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Cite this

Exploiting sparsity in semidefinite programming via matrix completion II : Implementation and numerical results. / Nakata, Kazuhide; Fujisawa, Katsuki; Fukuda, Mituhiro; Kojima, Masakazu; Murota, Kazuo.

In: Mathematical Programming, Series B, Vol. 95, No. 2, 01.02.2003, p. 303-327.

Research output: Contribution to journalArticle

Nakata, Kazuhide ; Fujisawa, Katsuki ; Fukuda, Mituhiro ; Kojima, Masakazu ; Murota, Kazuo. / Exploiting sparsity in semidefinite programming via matrix completion II : Implementation and numerical results. In: Mathematical Programming, Series B. 2003 ; Vol. 95, No. 2. pp. 303-327.
@article{713010ca36904c45828b82a9ca37c1e9,
title = "Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results",
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.",
author = "Kazuhide Nakata and Katsuki Fujisawa and Mituhiro Fukuda and Masakazu Kojima and Kazuo Murota",
year = "2003",
month = "2",
day = "1",
doi = "10.1007/s10107-002-0351-9",
language = "English",
volume = "95",
pages = "303--327",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "2",

}

TY - JOUR

T1 - Exploiting sparsity in semidefinite programming via matrix completion II

T2 - Implementation and numerical results

AU - Nakata, Kazuhide

AU - Fujisawa, Katsuki

AU - Fukuda, Mituhiro

AU - Kojima, Masakazu

AU - Murota, Kazuo

PY - 2003/2/1

Y1 - 2003/2/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=1542337154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1542337154&partnerID=8YFLogxK

U2 - 10.1007/s10107-002-0351-9

DO - 10.1007/s10107-002-0351-9

M3 - Article

AN - SCOPUS:1542337154

VL - 95

SP - 303

EP - 327

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -