Question: Let s suppose we have a function representing a surface, namely z = x 2 4 x + y 4 1 2 y 3 +
Lets suppose we have a function representing a surface, namely
z xx yyyy
We dont know where the minimum best solution might be We guess x and y
because this takes zero effort.
a pts Compute the twodimensional negative gradient, ~zzxzy
and evaluate it at In which angular direction is it pointing?
b pts Algorithms need a step length to move along the negative gradient. Most
of the time this is a value that starts at Take a unit step~z in the direction
of the negative gradient. If the new value of z at the updated position x y is lower
than the value at then we can accept the updated value. If not, we can divide by
two and try that. We repeat until we get a lower value. Report your new coordinates
x y and your first successful step length
c pts Repeat what you did in b except update the starting value of to twice its
value the last time it worked. If the new try is not lower than the current lowest value
of z then divide the steplength by Note that you have to use the updated position
x y to get the new direction of descent. Repeat until you are successful. What is
the first successful try you make, and what is the new value of z at the updated coordi
nates x y Please give the step length, the values of x y and the function value z
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
