ConceptEngineering
Semidefinite programming (SDP) for polynomials
A framework where polynomial non-negativity is enforced via coefficient matching against a positive semidefinite matrix.
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.
Polynomials1Semidefinite programming1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.