Numerically find the minimum optimal feasible design (vector x)for each of the following problems using any gradient based searchtechnique. for each run record the starting point and iterationhistory (plot a graph with objective function on y axis anditeration number on x axis), record also the final point at whichthe iteration terminated and whether or not the final solution isfeasible. Do ten runs for each problem. Discuss your result.
1)The banana function: In this problem there are two designvariables with lower and upper limits of [-5,5] the function has aglobal minimum at [1,1] with an optimal function value of zero.
Minimize f(x) =100(x2-x1^2)^2
PayPal Gateway not configured
PayPal Gateway not configured