120 likes | 188 Views
Constrained Optimization. Ref: wikipedia; Jensen. Method of Lagrange Multipliers. Consider the optimization problem. Imagine walking along g =c; the value of f varies. The maximum occurs where the contour line and g touch. The gradient vectors of f and g are dependent at the maximum.
E N D
Constrained Optimization Ref: wikipedia; Jensen
Method of Lagrange Multipliers • Consider the optimization problem Imagine walking along g=c; the value of f varies The maximum occurs where the contour line and g touch The gradient vectors of f and g are dependent at the maximum
Lagrange Multiplier (cont) • Gradient vectors of f and g are dependent at the maximum • The new variable, l, is called the Lagrange multiplier • A new auxiliary function is introduced • The optimum can be obtained by solving the stationary points of the Lagrangian L
General Formulation • Objective function: f(x) • The constraints: gk(x) = 0 • Lagrangian:
Lagrange Multipliers in Action • Ex: a box of volumn V, with minimal surface area
Closest Point of a Line to a Point Approach 1:
1st iteration (all constraints inactive) (violate) Set g2 = 0 Active set method g2 g1 (4,4) g3 2nd iteration Solution (KKT):