Let f: R R be a quadratic form f(x) = 1xQx where Q0. Suppose that the steepest descent method with exact line search is applied to solve the unconstrained optimization problem minxen f(x). If the p-th iterate xp is not optimal, find the stepsize X* of the steepest descent method for computing the new iterate Xp+1. That is, find X* 0 such that f(xp - X* Vf(xp)) = ) = min f(xp - XV (xp)). X>0