Past exam of the numerical linear algebra and continuous optimisation course of the University of Oxford / 2007 / B / 7 / vi / Solution

Use the uniform lower step bound from part (iv):Thus $\boxed{g(x_k)\to 0}$. This is convergence to stationarity in the usual global convergence theorem for the steepest descent method. It does not itself prove that the iterates converge, or that any stationary limit is a global minimizer of a nonconvex objective.