1 OR II GSLM 52800. 2 Outline  equality constraint  tangent plane  regular point  FONC  SONC  SOSC.

Slides:



Advertisements
Similar presentations
Fin500J: Mathematical Foundations in Finance
Advertisements

Nonlinear Programming McCarl and Spreen Chapter 12.
1 OR II GSLM Outline  some terminology  differences between LP and NLP  basic questions in NLP  gradient and Hessian  quadratic form  contour,
Semester 1 Review Unit vector =. A line that contains the point P(x 0,y 0,z 0 ) and direction vector : parametric symmetric.
1 OR II GSLM Outline  classical optimization – unconstrained optimization  dimensions of optimization  feasible direction.
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
L12 LaGrange Multiplier Method Homework Review Summary Test 1.
Easy Optimization Problems, Relaxation, Local Processing for a small subset of variables.
Optimization in Engineering Design 1 Lagrange Multipliers.
OPTIMAL CONTROL SYSTEMS
Duality Dual problem Duality Theorem Complementary Slackness
Constrained Optimization
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Exploiting Duality (Particularly the dual of SVM) M. Pawan Kumar VISUAL GEOMETRY GROUP.
Economics D10-1: Lecture 12 Cost minimization and the cost function.
MAE 552 – Heuristic Optimization Lecture 1 January 23, 2002.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Optimality Conditions for Nonlinear Optimization Ashish Goel Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality.
Tier I: Mathematical Methods of Optimization
Introduction to Optimization (Part 1)
KKT Practice and Second Order Conditions from Nash and Sofer
1 Example 1 Sketch the graph of the function f(x) = x 3 -3x 2 -45x+47. Solution I. Intercepts The x-intercepts are the solutions to 0= f(x) = x 3 -3x 2.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
5.1 – Introduction to Quadratic Functions Objectives: Define, identify, and graph quadratic functions. Multiply linear binomials to produce a quadratic.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Second Order Partial Derivatives
1 Unconstrained Optimization Objective: Find minimum of F(X) where X is a vector of design variables We may know lower and upper bounds for optimum No.
LAGRANGE mULTIPLIERS By Rohit Venkat.
SECTION 1.3 PROPERTIES OF FUNCTIONS PROPERTIES OF FUNCTIONS.
Nonlinear Programming Models
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
1 Solve each: 1. 5x – 7 > 8x |x – 5| < 2 3. x 2 – 9 > 0 :
Optimization unconstrained and constrained Calculus part II.
L8 Optimal Design concepts pt D
Example 1A Solve the equation. Check your answer. (x – 7)(x + 2) = 0
Math 4030 – 6a Joint Distributions (Discrete)
Chapter 3 Test Review Algebra II CP Mrs. Mongold.
Signal & Weight Vector Spaces
Performance Surfaces.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Economics 2301 Lecture 37 Constrained Optimization.
Calculus III Hughes-Hallett Chapter 15 Optimization.
LINEAR PROGRAMMING Classic Types of Constrained Decision Problems 1. Product Mix 2. Ingredient Mix 3. Transportation 4. Assignment 5. Time Period.
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
OR II GSLM
Algebra II.  To remember everything in 1 st Semetser!
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
deterministic operations research
Chapter 11 Optimization with Equality Constraints
Computational Optimization
L11 Optimal Design L.Multipliers
Computational Optimization
Lecture 8 – Nonlinear Programming Models
Algebra 7 pence a 3 2 If the price of an apple is given as
3-3 Optimization with Linear Programming
Operational Research (OR)
L5 Optimal Design concepts pt A
L10 Optimal Design L.Multipliers
Concept of a Function.
Outline Unconstrained Optimization Functions of One Variable
EE 458 Introduction to Optimization
Performance Surfaces.
Nonlinear programming
CS5321 Numerical Optimization
Calculus-Based Optimization AGEC 317
Algebra 7 pence a 3 2 If the price of an apple is given as
Presentation transcript:

1 OR II GSLM 52800

2 Outline  equality constraint  tangent plane  regular point  FONC  SONC  SOSC

3 Problem Under Consideration  min f(x)  s.t.g i (x) = 0 for i = 1, …, m, (which can be put as g(x) = 0)  x  S   n

4 Equality Constraint, Tangent Plane, and Gradient at a Point g(x) = 0 x*x* Tg(x*)Tg(x*) any vector on the tangent plan of point x * is orthogonal to  T g(x * ) y1y1 y2y2

5 Regular Point  the collection of constraints  g 1 (x) = 0, …, g m (x) = 0  x 0 is a regular point if  g 1 (x 0 ), …,  g m (x 0 ) are linearly independent

6 Lemma 4.1  x * be a local optimal point of f and a regular point with respect to the equality constraints g(x) = 0  any y satisfying  T g(x * )y = 0   T f(x * )y = 0  y on tangent planes of g 1 (x * ), …, g m (x * )

7 Interpretation of Lemma 4.1 g 1 (x) = 0 g 2 (x) = 0 Tg2(x*)Tg2(x*) x*x* Tg1(x*)Tg1(x*) What happens if  T f is not orthogonal to the tangent plane?  Tf(x*)Tf(x*)

8 FONC for Equality Constraints (for max & min)  (i) x * a local optimum  (ii) objective function f  (iii) equality constraints g(x) = 0  (iv) x * a regular point  then there exists   m for  (v)  f(x * ) + T  g(x * ) = 0  (v) + g(x * ) = 0  FONC

9 FONC for Equality Constraints in Terms of Lagrangian Function (for max & min) The FONC can be expressed as:

10 Example 4.1  min 3x+4y,  s.t.g 1 (x, y)  x 2 + y 2 – 4 = 0, g 2 (x, y)  (x+1) 2 + y 2 – 9 = 0. Check the FONC for candidates of local minimum

11 Algebraic Form of Tangent Plane  M: the tangent plane of the constraints  M = {y|  T g(x * )y = 0}

12 Hessian of the Lagrangian Function  Lagrangian function  gradient of L  L   f (x * ) + T  g (x * )  Hessian of L L(x * )  F(x * ) + T G(x * )

13 SONC for Equality Constraints  (i) x * a local optimum  (ii) objective function f  (iii) equality constraints g(x) = 0  (iv) x * a regular point  SONC = FONC (  f(x * )+ T  g(x * ) = 0 and g(x * ) = 0) + L(x * ) is positive semi-definite on M

14 SOSC for Equality Constraints  (i) x * a regular point  (ii) g(x * ) = 0  (iii)  f(x * ) + T  g(x * ) = 0 for some   m  (iv) L(x * ) = F(x * ) + T G(x * ) (+)ve def on M  then x * being a strict local min

15 Examples  Examples 4.2 to 4.6