Sign inSign in
ConceptEngineering

Convex relaxation

Replacing discrete constraints like binary variables with continuous bounds between 0 and 1 to make the problem convex.
Watch it explained

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.

Convex optimization1Convexity1Mixed-integer program1Mixed-integer programming1Relaxation methods1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Stephen Boyd

    Stanford University · Undergraduate

    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.
    • 21:30Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods

Lectures that assume it

2

Connections

11

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.