Classification: Mathematical ProgrammingAugust 2004Abstract. The SDPA-C (SemiDefinite Programming Algorithm – Completion method) is a soft-ware package designed for solving large scale sparse SDPs (semidefinite programming problems).In particular, the SDPA-C solves an SDP quite efficiently in computational time and memory ifthe aggregated sparsity pattern of the data matrices induces a sparse chordal extension of theaggregate sparsity pattern matrix; if not, the standard version of the SemiDefinite ProgrammingAlgorithm, SDPA solves the SDP faster. Using the positive definite matrix completion theory,the SDPA-C stores only sparse matrices and perform matrix computations that take advantagesof their sparsity. For theoretical and technical details of the SDPA-C, see the papers Fukuda-Kojima-Murota-Nakata (2000) and Nakata-Fujisawa-Fukuda-Kojima-Murota (2003) listed in thereferences of this manual.This manual, the SDPA-C, and the instructions for its installation can be found in the WWWsitehttp://www.is.titech.ac.jp/˜kojima/sdpa/index.html.Key words Semidefinite Programming, Interior-Point Method, Matrix Completion,Computer Software
[1]
Masakazu Kojima,et al.
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
,
2003,
Optim. Methods Softw..
[2]
Katsuki Fujisawa,et al.
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results
,
2003,
Math. Program..
[3]
Kazuo Murota,et al.
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
,
2000,
SIAM J. Optim..
[4]
Brian Borchers,et al.
SDPLIB 1.1, A Library of Semidefinite Programming Test Problems
,
1998
.