Question

3. a) Short questions (Please briefly justify your answers in each case to receive full credits) 1) If we wish to minimize a function, fx.y) = 2x2+ 5x22+10, using Univariate Search method, how many searches will it take to reach the minimum and why? -L1 ii) Starting from an initial guess, Xo the minimization of the following function using Newton-Raphson method fails to work. Please explain why. fX) 0.5x2+2x1x- (1/3)x3+ 50 Note: N-R method: X- X1 - [H(X-1)] 'af(X1), where H is Hessian matrix, Af is gradient vector] ii) Three highly nonlinear curves, f(x,y), g(x,y) and h(x,y), intersect each other at a point, (x*,y* which we by an unconstrained multivariable computer optimization technique. need to find. Formulate the above problem as an optimization problem that can be solved

Answer 1

wish tn matimze daunedian Hanchey This Ome. climemyi am Cmet hed at a time thus oftmising ly Nngle riable cr which gie 1 0 mimimize Then mimim 2e 5t which two pmehey to get to the will fake S it ok fwo caabley and Cminimesm Since it is with Cmininum iA O CStautirg imitial Guem no an 50 211-7- 1 2 & elnedy dtfFee) Sy VHAO i mot im vetible Hermian matrix So, Newton Raphs on Arail hre. as M NOT imwatle at foint

imteaxet each athen at a toint (niy We And meed to an oftimiait iom frablem unonytruaime d techmiqe The that cdove pooHem a be can Opfimiantian multvaualle compuder th+gny +p hln max F t Awith vlitgnl ht,= O