Semidefinite Programming

The field of Semidefinite Programming (SDP) or Semidefinite Optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with linear cost function and linear constraints. Popular special cases are linear programming and convex quadratic programming with convex quadratic constraints. This page collects links to papers, software, announcements, etc. that may be of relevance for people working in Semidefinite Programming.

CAVEAT: Neither are the given lists of papers complete nor do they always provide the most recent reference.

BUT: The intention is to provide a useful page for the entire semidefinite community. To make and keep this page sufficiently complete and up to date I need your help. Please do inform me about necessary updates or missing contributions and mail suggestions or comments to
helmberg@mathematik.tu-chemnitz.de

Conferences and Workshops (19.01.2009)
Survey Papers and Books (19.01.2009)
Interior Point Algorithms (23.01.2008)
Other Algorithmic Approaches (23.01.2008)
Geometry and Complexity (23.01.2008)
Combinatorial Optimization (03.03.2008)
Sum of Squares and Polynomial Optimization (19.01.2008)
Control Theory (21.04.2002)
Miscellanies (03.03.2008)
Software (23.01.2008)
Other Sites dealing with semidefinite programming (08.04.2005)
People in semidefinite programming. (18.04.2005)

(dd.mm.year) gives the date of the last change in the section.

Last modified: Mon Jan 19 11:27:07 CET 2009

Semidefinite Programming

Contents