Question

2. Write a programmets) to solve the optimization problem where d is defined as above, by the following methods (a) the steepest descent method, (b) any conjugate gradient method, and (c) any quasi-Newton method. Run the programme and terminate it when either g)110-6 or the number of iterations reaches 100. Then provide the following (without the programme): (d) For each method, describe the way of obtaining a) andr) (e) For each method, provide a table of results (rounded to 4 decimal places) which shows the values of k, f(k) and lig( 2, for k = 1, 2, 3, 10, and at termination. (f) Give your comments on the numerical results for each method and state the preferable method with justification.