ConceptEngineering
Dual decomposition
A technique that introduces local copies of complicating variables and a consistency constraint to split a problem into separable dual subproblems.
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 optimization2Lagrangian duality2Duality in convex optimization1Lagrange duality1Lagrange multipliers1Primal decomposition1Subgradient method1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Stephen Boyd
Connections
10The lectures that define it or assume it, and the concepts next to it.