· 6 min
Convex Duality and the KKT Conditions
How a constrained minimum is certified. The Lagrangian and its dual function, weak duality, strong duality under Slater's condition from the supporting hyperplane theorem, and the Karush-Kuhn-Tucker conditions that characterise the optimum of a convex program.