ConceptEngineering
Global optimization via SOS
Finding the global minimum of a non-convex polynomial by framing it as maximizing a lower bound subject to a sums-of-squares constraint.
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.
Semidefinite programming1Sums-of-squares optimization1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.