3. Compare your BFGS and L-BFGS codes with the Gradient Descent (GD) method using the Armijo line Search developed in Problem 1 (a), i.e., let xk+1 = xk + kdk, where dk -Vf(xk) and ak >0 satisfies (1). Report numerical experiments of solving the following problem min f(x) = In 1 m + TERT 2