A New Library of Structured Semidefinite Programming Instances
by E. de Klerk and R. Sotirov
In order to stimulate further development of codes for semidefinite programming (SDP),
that include more sophisticated pre-processing techniques for problems with special structure,
we present a new test set of SDP instances.
The instances arise from applications of SDP in coding theory, computational geometry, graph theory,
and truss topology design.
Most of these instances have a structure that may be exploited during a pre-processing phase,
e.g. algebraic symmetry, chordal structure, or low rank in the constraint matrices.
Documentation:
** The authors would
also like to thank Katsuki Fujisawa, Hans Mittelmann, Maho Nakata, and Makoto Yamashita
for providing
more accurate optimal values for several of the SDP instances in the new library by using the
SDPA–GMP solver.
The test instances come from the following applications of SDP:
All problems are stored in the SDPA sparse format:
Other test sets of SDP instnces:
Benchmarks for Optimization Software