Numerical Computation and Optimization

Slides:



Advertisements
Similar presentations
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 14.
Advertisements

Line Search.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 One-Dimensional Unconstrained Optimization Chapter.
Copyright © Cengage Learning. All rights reserved.
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
Optimization Methods One-Dimensional Unconstrained Optimization
ISM 206 Lecture 6 Nonlinear Unconstrained Optimization.
Optimization Methods One-Dimensional Unconstrained Optimization
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Prentice Hall Extreme Values of Functions Section 4.1.
UNCONSTRAINED MULTIVARIABLE
4.1 Maximum and Minimum Values. Maximum Values Local Maximum Absolute Maximum |c2|c2 |c1|c1 I.
AP CALCULUS AB Chapter 4: Applications of Derivatives Section 4.1:
Part 2 Chapter 7 Optimization
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Chapter 7 Optimization. Content Introduction One dimensional unconstrained Multidimensional unconstrained Example.
Chapter 3 Non-Linear Functions and Applications Section 3.1
Particle Swarm Optimization by Dr. Shubhajit Roy Chowdhury Centre for VLSI and Embedded Systems Technology, IIIT Hyderabad.
Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm
Measures Of Central Tendency
Exam 1 Oct 3, closed book Place ITE 119, Time:12:30-1:45pm One double-sided cheat sheet (8.5in x 11in) allowed Bring your calculator to the exam Chapters.
MATLAB Numerical Basics. Roots of Polynominals MATLAB can find all roots (both real and imaginary) of polynominals. Store coefficients in a vector v =
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 - Chapter 7 Optimization.
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
Test Corrections On a separate sheet (not the original test), correct all your mistakes carefully. Hand both in, not stapled together. Do this work on.
Using Derivatives to Find Absolute Maximum and Minimum Values
Introduction to Optimization
Numerical Measures: Centrality and Variability
Graph Vocabulary and Interpreting Graphs of Functions
Chapter 14.
Linear Programming in Two Dimensions
Using Derivatives to Find Absolute Maximum and Minimum Values
Applications of Differential Calculus
Limits at Infinity; Horizontal Asymptotes
Horizontal Asymptotes
Copyright © Cengage Learning. All rights reserved.
Midterm Review Answers #23-43
Section 4.3 Optimization.
Extreme Values of Functions
Extreme Values of Functions
Chapter 7 Optimization.
-20 is an absolute minimum 6 is an absolute minimum
Find the local minimum value of {image} {applet}
Chapter 7: Optimization
L5 Optimal Design concepts pt A
Numerical Computation and Optimization
Numerical Computation and Optimization
Compute convex lower bounding function and optimize it instead!
Copyright © Cengage Learning. All rights reserved.
Classification of optimization problems
Numerical Computation and Optimization
4.1 Maximum and Minimum Values
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
Copyright © Cengage Learning. All rights reserved.
Extreme Values of Functions
Part 4 - Chapter 13.
Copyright © Cengage Learning. All rights reserved.
Numerical Computation and Optimization
Numerical Computation and Optimization
Copyright © Cengage Learning. All rights reserved.
Warm up  .
Copyright © Cengage Learning. All rights reserved.
Numerical Computation and Optimization
Part 2 Chapter 7 Optimization
What are optimization methods?
Section – Linear Programming
Copyright © Cengage Learning. All rights reserved.
Extreme values of functions
Optimization formulation
Maximum and Minimum Values
Analyzing Multivariable Change: Optimization
Presentation transcript:

Numerical Computation and Optimization Numerical Optimization Golden-section Search By Assist Prof. Dr. Ahmed Jabbar

One-Dimensional Unconstrained Optimization This section will describe techniques to find the minimum or maximum of a function of a single variable, f (x). A useful image in this regard is the one-dimensional, “roller coaster”. Recall from Part Two that root location was complicated by the fact that several roots can occur for a single function. Similarly, both local and global optima can occur in optimization. Such cases are called multimodal. In almost all instances, we will be interested in finding the absolute highest or lowest value of a function. Thus, we must take care that we do not mistake a local result for the global optimum.

10.