ConceptPhysics
Lagrangian duality
The minimization of a convex function under constraints that leads to a consequence of Lagrangian transform and Fenchel transform.
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.
Dual decomposition2Complementary slackness1Dual decomposition for network flow1Dual feasibility certification1Dual problem1Dual rate control problem1Equality constrained analytic centering1Lagrange duality with generalized inequalities1Lagrangian (rate control)1Network flow Lagrangian1Perturbation analysis1Reformulation via new variables and equality constraints1
Lecturers
1Lectures that assume it
8- Support Vector Machines
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Subgradient Methods for Constrained Problems
- Convex Optimization II: Primal and Dual Decomposition Methods
- Convex Optimization II: Decomposition Applications
- Duality Theory
- Equality Constrained Minimization Continued
- Interior-Point Methods
Connections
16The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Convex optimization
- Lagrange multipliers
- Dual decomposition
- Complementary slackness
- Dual decomposition for network flow
- Dual feasibility certification
Show 1 moreShow fewer
Lectures9
- Statistical Thermodynamics as a Paradigm for Data Science
- Support Vector Machines
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Subgradient Methods for Constrained Problems
- Convex Optimization II: Primal and Dual Decomposition Methods
- Convex Optimization II: Decomposition Applications