Assignment -1
Subject: EE315 Optimization method
Submission Date: 28 / 09/2020
1. Define the following terms
Stationary Point, Extreme Point, Saddle Point and Point of Inflection
2. Write down the difference between Fibonacci method and Golden section
method.
3. Explain steps of interval halving and Secant Method.
4. Describe briefly the algorithms Newton Raphson and successive quadratic
estimation method
5. Solve the following problems by fibonnaci method
a) Max 4,
= 2 , in the interval [1, 5] taking n=5
b) Min 3, 3
=6 , 3in the interval [0,5] taking n=5
c) Minimize the function f (x) = 2 − 4x + exp(x) in the interval [0.5, 2.5] with an
accuracy of = 0.001 applying fibonnaci method.
6. Solve the following by applying golden section method
a) Maximize 2 3, 1 4
= 12 3 , 4 6By golden section method within the
interval of un certainity as [2, 6] and n=6
b) Use the golden section search to find the value of that minimizes
14 60 70 in the range [0, 2]. Locate this value of to within a range of
0.3.
7. Solve the bracket the minimum of the function
f(x) = ;using the bounding phase method and Region elimination
method.
8. Using Newton’s method, find the minimizer of .The initial
value is 0.5 . The required accuracy is 10 in the sense that we
stop when
9. Find the root of the equation 12.2 7.45 42 0 using the
secant method
10. Use two iterations of Powells quadratic estimation method to minimizethe
function
f(x) = 2 exp (x) − x3 − 10x.
11. Find at least one root of the following functions:
a. f(x) = exp (x) − x3.b. f(x) = (2x − 5)4 − (x2 − 1)3.
12. Solve the following by Bisection method find the root of 0 with a
= 0 and b= 1.
13. A function is given by x – e-x = 0. Find the root between a = 0 and b = 1 by
applying Bisection method
14. Compare the bisection and secant methods in terms of the obtained interval
after 10 function evaluations for the minimization of the function f(x) = exp (x)
− x3in the interval (2, 5). How does the outcome change if the interval (−2, 5)
is chosen?
15. Use the following approximating second-order polynomial
q(x) = a0 + a1(x − x1) + a2(x − x1)(x − x2)to match the objective function values
f1 and f2 at two points x1 and x2 (withx2> x1), respectively, and the first
derivative f1 at x1.
(i) Find a0, a1, and a2 in terms of x1, x2, f1, f2, and f1′
(ii) Find the minimum of the approximating function.
