Optimization Online


A new library of structured semidefinite programming instances

Etienne De Klerk (e.deklerk***at***uvt.nl)
Renata Sotirov (r.sotirov***at***uvt.nl)

Abstract: 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 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.

Keywords: semidefinite programming, test problems

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: CentER Discussion Paper Tilburg University, The Netherlands, August 2008

Download: [PDF]

Entry Submitted: 08/16/2008
Entry Accepted: 08/16/2008
Entry Last Modified: 09/02/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society