Let the function q: R" + R be defined as our core example in lecture: q(x) = x+Qx - b'x, with Q QT positive definite. Select all methods guaranteed to arrive at the unique minimizer x* of q(x) in at most n iterations for any choice of initial point x(0). Steepest Descent Method Conjugate Gradient BFGS (a Quasi-Newton Method with Hk positive definite) Newton's Method Let the function q: R" + R be defined as our core example in lecture: q(x) = x+Qx - b'x, with Q QT positive definite. Select all methods guaranteed to arrive at the unique minimizer x* of q(x) in at most n iterations for any choice of initial point x(0). Steepest Descent Method Conjugate Gradient BFGS (a Quasi-Newton Method with Hk positive definite) Newton's Method