Opening Convex Optimization II: Decomposition Applications
Convex Optimization II: Decomposition Applications
- Length
- 1 h 17 min
- Level
- Graduate
- Recorded
- Stanford University2008
Chapter 1 of 6: Before the lecture
Boyd prices network links with dual variables so each flow sets its own rate through subgradient updates.
Network rate control and single commodity network flow problems demonstrate decentralized optimization via dual decomposition. Boyd formulates rate allocation with concave utilities subject to link capacities, and single commodity flow with convex costs under flow conservation constraints. Subgradient methods iteratively update link prices or node potentials while individual flows or edges independently minimize local net utilities or costs. Numerical examples illustrate convergence behaviors, primal residuals, and capacity violations.
Network rate control and single commodity network flow problems demonstrate decentralized optimization via dual decomposition. Boyd formulates rate allocation with concave utilities subject to link capacities, and single commodity flow with convex costs under flow conservation constraints. Subgradient methods iteratively update link prices or node potentials while individual flows or edges independently minimize local net utilities or costs. Numerical examples illustrate convergence behaviors, primal residuals, and capacity violations.
This lecture
Lecture 29 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