Opening Convex Optimization II: Primal and Dual Decomposition Methods
Convex Optimization II: Primal and Dual Decomposition Methods
- Length
- 1 h 11 min
- Level
- Graduate
- Recorded
- Stanford University2008
Chapter 1 of 10: Before the lecture
Proves the ellipsoid method's 2n² log(RG/ϵ) step bound, then splits problems by primal and dual decomposition.
Decentralized convex optimization breaks complex problems into smaller subproblems through primal and dual decomposition methods. The lecture reviews the ellipsoid method and its polynomial time complexity, and then transitions to large-scale optimization using coordinate separation. Primal decomposition fixes complicating variables to coordinate independent subproblems via a master problem. Dual decomposition introduces local variable copies and consistency constraints to solve decoupled dual subproblems in parallel.
Decentralized convex optimization breaks complex problems into smaller subproblems through primal and dual decomposition methods. The lecture reviews the ellipsoid method and its polynomial time complexity, and then transitions to large-scale optimization using coordinate separation. Primal decomposition fixes complicating variables to coordinate independent subproblems via a master problem. Dual decomposition introduces local variable copies and consistency constraints to solve decoupled dual subproblems in parallel.
New York Times

This lecture
Lecture 27 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.
Your comment is kept while you sign up.Sign in