1 / 13

CS B553: Algorithms for Optimization and Learning

CS B553: Algorithms for Optimization and Learning. Constrained optimization. Key Concepts. Constraint formulations Necessary o ptimality conditions Lagrange multipliers: equality constraints KKT conditions: equalities and inequalities. Figure 1. Objective function f. Figure 1.

tamah
Télécharger la présentation

CS B553: Algorithms for Optimization and Learning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CS B553: Algorithms for Optimization and Learning Constrained optimization

  2. Key Concepts • Constraint formulations • Necessary optimality conditions • Lagrange multipliers: equality constraints • KKT conditions: equalities and inequalities

  3. Figure 1 Objective function f

  4. Figure 1 Objective function f + feasible set S S

  5. Figure 2 Local minima are either local minima of f or on the boundary of S S

  6. Figure 3 Bound constraints Linear inequalities Ax b u2 S S Ai (row i) l2 l1 u1 bi Linear equalities Ax=b General, nonlinear constraints h1(x)0 A1 S S h2(x)0 g1(x)=0 b1

  7. Figure 4 Lagrange multipliers: one equality constraint At a local minimum (or maximum), the gradient of the objectiveand the constraint must be parallel f(x2) g(x2) x2 f(x1) x1 g(x)=0 g(x1)

  8. Figure 5 If the constraint gradient and the objective gradient are notparallel, then there exists some direction v that you can move into change f without changing g(x) v g(x) x f(x)

  9. Figure 6 Interpretation: Suppose x* is a global minimum. I were to relax the constraint g(x)=0 at a constant ratetoward g(x)=1, the value of  tells me the rate of decrease off(x*). f(x*) = - g(x*) x* g(x*)

  10. Figure 7 One inequality constraint h(x)  0. Either: h(x)> 0 h(x)< 0 h(x)= 0

  11. Figure 7 One inequality constraint h(x)  0. Either: 1. x is a critical point of f with h(x) < 0, or h(x)> 0 h(x)< 0 h(x)= 0 f(x1)=0

  12. Figure 7 One inequality constraint h(x)  0. Either: 1. x is a critical point of f with h(x) < 0, or 2. x is on boundary h(x) = 0 and satisfies a Lagrangian condition h(x)> 0 h(x)< 0 f(x3) h(x)= 0 g(x3) x3 f(x2) x2 g(x2)

  13. Figure 8 Multiple inequality constraints h2(x) < 0 h1(x)< 0 x x

More Related