Definition
By allowing inequality constraints, generalizes the method of Lagrange multiplier, which allows only equality constraints.
Given general problem subject to
The KKT conditions are
- Stationarity:
- Primal feasibility:
- Dual feasibility:
- Complementary slackness:
Facts
The gradient of inequality constraint and the gradient of the function should be in opposite directions.
![]()
If and don’t have opposite directions, then there is the area(direction) decreasing both and
For a problem with Strong Duality, are optimal satisfy the KKT conditions
For a convex optimization, satisfy the KKT condition Strong Duality holds
Proof Since are all convex function, the Lagrangian primal function is also convex
Let be the values satisfy KKT conditions. By the stationarity condition, So, is a local minimum of and by the convexity, it is also global minimum Therefore, ^[Lagrange dual function]
Also, by the complementary slackness and primal feasibility conditions, So, Therefore, the dual optimal value and the primal optimal value is the same. In other words, satisfy the Strong Duality condition
are optimal
For a problem with Slater’s Condition (ensure Strong Duality and convexity), and satisfy the KKT condition are optimal
Proof Let be the primal and dual solutions
Since are the dual optimal, the dual optimal value can be expressed as an expression in regard to where
Since is a feasible value, the with , is always greater than or equal to the with and by the constraints of Lagrangian primal function, and So,
In summary
Since Slater’s Condition ensures Strong Duality , the inequality become the equality Therefore, , so the complementary slackness condition is satisfied Also, , so the stationary condition is satisfied Finally, since are the primal and dual solutions, the constraints of Lagrangian primal and dual function, satisfy the primal and dual feasibility condition
The gradient of inequality constraint
