L6 Optimal Design concepts pt B

Slides:



Advertisements
Similar presentations
Introducción a la Optimización de procesos químicos. Curso 2005/2006 BASIC CONCEPTS IN OPTIMIZATION: PART II: Continuous & Unconstrained Important concepts.
Advertisements

Engineering Optimization
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.
Page 1 Page 1 Engineering Optimization Second Edition Authors: A. Rabindran, K. M. Ragsdell, and G. V. Reklaitis Chapter-2 (Functions of a Single Variable)
Optimization using Calculus
D Nagesh Kumar, IIScOptimization Methods: M2L3 1 Optimization using Calculus Optimization of Functions of Multiple Variables: Unconstrained Optimization.
Relative Extrema: Graphing Polynomials Objective: We will locate relative maximum and minimum values and use all of our knowledge to graph polynomials.
Computational Optimization
L13 Optimization using Excel See revised schedule read 8(1-4) + Excel “help” for Mar 12 Test Answers Review: Convex Prog. Prob. Worksheet modifications.
1. Problem Formulation. General Structure Objective Function: The objective function is usually formulated on the basis of economic criterion, e.g. profit,
Nonlinear Programming Models
7. Concavity and convexity
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
L8 Optimal Design concepts pt D
Using Derivatives to Sketch the Graph of a Function Lesson 4.3.
Calculus: Hughs-Hallett Chap 5 Joel Baumeyer, FSC Christian Brothers University Using the Derivative -- Optimization.
Calculus: Hughs-Hallett Chap 5 Joel Baumeyer, FSC Christian Brothers University Using the Derivative -- Optimization.
Optimality Conditions for Unconstrained optimization One dimensional optimization –Necessary and sufficient conditions Multidimensional optimization –Classification.
Signal & Weight Vector Spaces
Performance Surfaces.
Introduction to Optimization
Relative Extrema: Graphing Polynomials Objective: We will locate relative maximum and minimum values and use all of our knowledge to graph polynomials.
MAXIMA AND MINIMA. ARTICLE -1 Definite,Semi-Definite and Indefinite Function.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
4.3 – Derivatives and the shapes of curves
Lesson: ____ Section: 4.3 All global extrema occur at either critical points or endpoints of the interval. So our task is to find all these candidates.
First derivative: is positive Curve is rising. is negative Curve is falling. is zero Possible local maximum or minimum. Second derivative: is positive.
deterministic operations research
6-3 Definite integrals & antiderivatives
Graph of a Function Def. A function f (x) has a local maximum (relative max) at x = p if f (x) < f (p) for all points near p. Def. A function f (x) has.
L11 Optimal Design L.Multipliers
Computational Optimization
Extreme Values of Functions
Maximum & Minimum values
Title: Higher order Derivatives & Stationary point H/W Marking
Lecture 8 – Nonlinear Programming Models
First and Second Derivatives Tests
Applications of Differential Calculus
CS5321 Numerical Optimization
1. Problem Formulation.
Concavity and Second Derivative Test
+ Definite, + semi definite, - definite & - semi definite functions
TOPICS ON CHAPTER 4 TEST: 1
Using Derivatives For Curve Sketching
4.3 – Derivatives and the shapes of curves
1 2 Sec 4.3: Concavity and the Second Derivative Test
Optimization Part II G.Anuradha.
L5 Optimal Design concepts pt A
L10 Optimal Design L.Multipliers
PRELIMINARY MATHEMATICS
PRELIMINARY MATHEMATICS
Basic Concepts of Optimization
Stationary Point Notes
Exponential Functions
Outline Unconstrained Optimization Functions of One Variable
Differentiation Summary
Shivangi’s Questions z = x3+ 3x2y + 7y +9 What is
Application of Differentiation
Derivatives and Graphing
Performance Surfaces.
The First Derivative Test
Identifying Stationary Points
Concavity & the 2nd Derivative Test
4.3 Using Derivatives for Curve Sketching.
Convex and Concave Functions
L7 Optimal Design concepts pt C
Multivariable optimization with no constraints
L8 Optimal Design concepts pt D
Presentation transcript:

L6 Optimal Design concepts pt B Homework Review Single variable minimization Multiple variable minimization Quadratic form Positive definite tests Summary Test 1 Wed formula sheet

Global/local optima Global Maximum? f(x*)≤ f(x) Anywhere in S Local Maximum? In small neighborhood N Closed & Bounded Weierstrass Theorem

Taylor Series Expansion Assume f(x) is: 1. Continuous function of a single variable x 2. Differentiable n times 3. x ∈ S, where S is non-empty, closed, and bounded 4. therefore x* is a possible optima

Taylor Series Approximations

Single variable minimization Given that x* is the minimum of f(x), then any movement away from x* is “uphill”, therefore to guarantee that a move goes uphill First-order necessary condition

Stationary point=max,min,neither Any points satisfying Are called “stationary” points. Those points are a: Min pt, or Max pt, or Neither (i.e. an inflection pt) We need another test!

Second-order sufficient condition Look at second order term Second-order sufficient condition for a minimum

Second-order condition? What if Then f(x*) is not a minimum of f(x*). It is a maximum of f(x*).

Single variable optimization First-order necessary condition Second-order sufficient condition for a minimum Second-order sufficient condition for a maximum

Higher—order tests? What if Then the second order test fails. We need higher order derivatives… Min Max

Second-order necessary conditions Note the “= 0” possibility A pt not satisfying this test is not a min! A pt not satisfying this test is not a max!

Multiple variable optimization If x* is the minimum of f(x), then any movement away from x* is “uphill”. How can we guarantee that for a move in any d, we make away from x*, we go “uphill”?

First-order necessary Condition For x* to be a local minimum: 1rst order term

Second-order sufficient condition For x* to be local minimum: That is H(x*) must be positive definite Remember that has “quadratic form”

Quadratic form of a matrix

Wuad From Ex

Positive definiteness? By inspection Leading principal minors Eigenvalues e.g. by inspection

Find leading principal minors to check PD of A(x)

Principal Minors Test for PD A matrix is positive definite if: 1.No two consecutive minors can be zero AND 2. All minors are positive, i.e. If two consecutive minors are zero The test cannot be used.

Principal Minors Test for ND A matrix is negative definite if: 1.No two consecutive minors can be zero AND 2. Mk<0 for k=odd 3. Mk>0 for k=even If two consecutive minors are zero The test cannot be used.

Eigenvalues Since x should not be zero… we should find values for lambda such that

Eigenvalue test Form Eigenvalue Test Positive Definite (PD) Positive Semi-def (PSD) Indefinite

Eigenvalue example Therefore A is NSD

Summary Single variable minimization Multiple variable minimization Quadratic form Positive definite tests