Opening Convex Optimization II: Primal and Dual Decomposition Methods
Convex Optimization II: Primal and Dual Decomposition Methods
- Length
- 1 h 10 min
- Level
- Graduate
- Recorded
- Stanford University2008
Chapter 1 of 4: Before the lecture
Stephen Boyd explains primal and dual decomposition for shared resource constraints in a graduate convex optimization lecture at Stanford University. He shows how fixing resource allocations separates subproblems and how Lagrange multipliers coordinate them as prices.

Your comment is kept while you sign up.Sign in
Formulates primal and dual decomposition methods for general hypergraph structures and traces their circuit analogues.
Stephen Boyd explains primal and dual decomposition for shared resource constraints in a graduate convex optimization lecture at Stanford University. He shows how fixing resource allocations separates subproblems and how Lagrange multipliers coordinate them as prices.
This lecture
Lecture 28 of 37 of Convex Optimization I.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.