Optimization: One-Dimensional Unconstrained Optimization
Optimization: One-Dimensional Unconstrained Optimization
One-Dimensional Unconstrained
Optimization
One-Dimensional Unconstrained
Optimization
› ITRODUCTION
› GOLDEN-SECTION SEARCH
› PARABOLIC INTERPOLATION
› NEWTON’S METHOD
› IF-ELSE
INTRODUCTION
› Study Objectives
› Computer Objectives
› Global-Local
INTRODUCTION
What are the components of an optimization problem?
› An objective function to be minimized or maximized.
› A decision variable
› Constraints
INTRODUCTION
Unimodal
› A function is unimodal on an interval [a,b] if it contains a
single answer
› the interval should contain a single maximum
GOLDEN-SECTION SEARCH
› Step 1
Guess bounds Xl & Xu
› Step 2
Find The Golden Ratio
GOLDEN-SECTION SEARCH
› Step 3
Deriving an Algorithm
› Step 4
If εa <= given εa
Terminate
GOLDEN-SECTION SEARCH
› Example
GOLDEN-SECTION SEARCH
› Example
GOLDEN-SECTION SEARCH
› Example
PARABOLIC INTERPOLATION
› a second-order polynomial often provides a good
approximation to a Parabola
› there is only one quadratic polynomial or parabola
connecting three points
› If we have three points that jointly bracket an optimum we
can fit a parabola to the points
› Then we can differentiate it, set the result equal to zero
› and solve for an estimate of the optimal x.
PARABOLIC INTERPOLATION
PARABOLIC INTERPOLATION
› It can be shown through some algebraic manipulations that
the result is
PARABOLIC INTERPOLATION
Deriving an Algorithm
› Step 1
find X3
› Step 2
X0 = X1
X1 = X2
X2 = X3
NEWTON’S METHOD
› Find f(x)
› Find f’(x)
› Find f’'(x) ≠ 0
› Have an initial guess Xi
› Solve Using this equation until Xi ≈ Xi+1
› Or until f’(Xi) ≈ 0
NEWTON’S METHOD
› Example
NEWTON’S METHOD
› Example
AE1
NEWTON’S METHOD
› Example using Excel
Slide 21