Sign inSign in
ConceptEngineering

Dual decomposition

A technique that introduces local copies of complicating variables and a consistency constraint to split a problem into separable dual subproblems.
as Stephen Boyd defines itStanford UniversityThe wording closest to all 3 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Stephen Boyd

    Stanford University · Graduate

    • 24:36Convex Optimization II: Primal and Dual Decomposition Methods
    • 30:59Convex Optimization II: Decomposition Applications

Connections

10

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

1 lecturer. 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.