We will calculate local extreme points for the function

Use the Steepest descent method on f with the start approximation (1, 1) to find the maximum point that is close (1, 1).

How many steps k are performed before the distance between two successive iteration points is less than 0.5 * 10 ^ (- 4), if you use the same value s_k = 0.04 in each step?

Answer: k =?

How many steps k is required if the Steepest descent method instead uses optimal step length in each step, ie. the s that minimizes Use the same start approximation (1, 1) and interrupt when the distance between two successive iteration points is less than 0.5 * 10 ^ (- 4).

Answer: k =?

For the point calculated with optimal step length:

x1 = ?

x2 = ?

(Enter the answers for the point in short format.)

3 2 3 f = x1 +0.531 +3.1x102 +0.922 3 1.1 22 : f(xk sif (xk)? 3 2 3 f = x1 +0.531 +3.1x102 +0.922 3 1.1 22 : f(xk sif (xk)