Question: Using the Nelder - Mead algorithm solve the following optimization problem with starting points ( x , y ) = { ( - 2 ,

Using the Nelder-Mead algorithm solve the following optimization problem with starting points (x,y)=
{(-2,-2),(-2,-4),(-3,-4)}
minf(x,y)=(1-x)2+100(y-x2)2
Does the method converge? Is the solution provided by the method optimal or just a stationary point?
Compare your solution using the Matlab function "fminsearch".
 Using the Nelder-Mead algorithm solve the following optimization problem with starting

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!