Solvers for semidefinite programming (SDP) have evolved a great deal in the last decade, and their development continues. In order to further support and encourage this development, we present a new test set of SDP instances. These instances arise from recent applications of SDP in the coding theory, computational geometry, graph theory and structural design. Most of these instances have a special structure that may be exploited during a pre-processing phase, e.g. algebraic symmetry, or low rank in the constraint matrices.
|Journal||Optimization Methods and Software|
|Publication status||Published - 2009|