1 / 31

Engineering Optimization

Engineering Optimization . Second Edition Authors: A. Rabindran, K. M. Ragsdell, and G. V. Reklaitis Chapter-2 (Functions of a Single Variable) Presenter: Avishek Nag June 11, 2010. Dedicated to…. All the neo-graduates whose insatiable urge to learn has not yet dimmed.

hayley
Download Presentation

Engineering Optimization

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. Engineering Optimization • Second Edition • Authors: A. Rabindran, K. M. Ragsdell, and G. V. Reklaitis • Chapter-2 (Functions of a Single Variable) • Presenter: Avishek Nag • June 11, 2010

  2. Dedicated to… • All the neo-graduates whose insatiable urge to learn has not yet dimmed

  3. What is a Function? • Is a rule that assigns to every choice of x a unique value y =ƒ(x). • Domain of a function is the set of all possible input values (usually x), which allows • the function formula to work. • Range is the set of all possible output values (usually y), which result from using the function formula.

  4. What is a Function? • Unconstrained and constrained function • Unconstrained: when domain is the entire set of real numbers R • Constrained: domain is a proper subset of R • Continuous, discontinuous and discrete

  5. ƒ(x) is unimodal on the interval if and only if it is monotonic on either side of the single optimal point x* in the interval. What is a Function? • Monotonic and unimodal functions • Monotonic: • Unimodal: Unimodality is an extremely important functional property used in optimization.

  6. A monotonic increasing function A monotonic decreasing function An unimodal function

  7. Optimality Criteria • In considering optimization problems, two questions generally must be addressed: • Static Question. How can one determine whether a given point x* is the optimal solution? • Dynamic Question. If x* is not the optimal point, then how does one go about finding a solution that is optimal?

  8. Optimality Criteria • Local and global optimum

  9. Identification of Single-Variable Optima • For finding local minima (maxima) • Proof follows… • These are necessary conditions, i.e., if they are not satisfied, x* is not a local minimum (maximum). If they are satisfied, we still have no guarantee that x* is a local minimum (maximum). AND

  10. Stationary Point and Inflection Point • A stationary point is a point x* at which • An inflection point or saddle-point is a stationary point that does not correspond to a local optimum (minimum or maximum). • To distinguish whether a stationary point is a local minimum, a local maximum, or an inflection point, we need the sufficient conditions of optimality.

  11. Theorem • Suppose at a point x* the first derivative is zero and the first nonzero higher order derivative is denoted by n. • If n is odd, then x* is a point of inflection. • If n is even, then x* is a local optimum. • Moreover: • If that derivative is positive, then the point x* is a local minimum. • If that derivative is negative, then the point x* is a local maximum.

  12. An Example • Thus the first non-vanishing derivative is 3 (odd), and x = 0 is an • inflection point.

  13. An Example Stationary points x = 0, 1, 2, 3 -Local minimum -Local maximum -Local minimum At x = 0 - Inflection point

  14. Algorithm to Find Global Optima

  15. An Example Stationary points x = -1, 3

  16. Region Elimination Methods

  17. Region Elimination Methods • Bounding Phase • An initial coarse search that will bound or bracket the optimum • Interval Refinement Phase • A finite sequence of interval reductions or refinements to reduce the initial search interval to desired accuracy

  18.  is positive  is negative  the minimum lies between Bounding Phase • Swann’s method • If • Else if the inequalities are reversed • If

  19. Interval Refinement Phase • Interval halving

  20. Interval Refinement Phase

  21. Polynomial Approximation or Point-Estimation Technique • Quadratic Approximation Method

  22. Successive Quadratic Estimation Method

  23. Methods Requiring Derivatives • Newton-Raphson Method

  24. Bisection Method

  25. Secant Method

  26. Cubic Search Method

  27. Cubic Search Method

  28. Summary • We learned… • Functions • Optimality criteria • Identification of single variable optima • Region elimination methods • Polynomial approximation or point-estimation technique • Methods requiring derivatives

More Related