ConceptEngineering
Convex relaxation
Replacing discrete constraints like binary variables with continuous bounds between 0 and 1 to make the problem convex.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Stephen Boyd
A technique where a non-convex problem is solved by forming a convex relaxation, solving it, and proving the solution can be rounded to a tight bound.
Lectures that assume it
2Connections
11The lectures that define it or assume it, and the concepts next to it.