Semidefinite Programming
SDP relaxations and applications to combinatorial optimization.
Semidefinite Programming. SDP relaxations and applications to combinatorial optimization.
Foundations and canonical references
The standard treatments of semidefinite programming approach the subject from complementary angles. Wolkowicz, Handbook of Semidefinite Programming (2000) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to.
Recent technical contributions
A handful of recent papers carry the methodological frontier of semidefinite programming forward. Semidefinite programming (Vandenberghe et al., 1996) is a primary reference for this area and develops new techniques or results that downstream work builds on.
Open methodological questions for semidefinite programming include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
-
- textbook · primary · 2000Handbook of Semidefinite Programmingwolkowicz-2000, saigal-2000, vandenberghe-2000
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.