ConceptTheory & Algos
Semidefinite programming (SDP) relaxation
A relaxation of an integer or combinatorial optimization problem into a semidefinite program that can be solved in polynomial time.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Linear programming1Positive semidefinite matrices1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.