The Armijo line search algorithm is a very well-known line search method (and has be re-discovered many times): f, Vf, x, 0 > 0, 0 ci 1, search direction d Input : Output: where f(x-sp)-f(x)-cjadTVf(x) end while show that this algorithm terminates in finite time provided dTVf(x) 0, f is bounded below, and f is at least once continuously differentiable. The Armijo line search algorithm is a very well-known line search method (and has be re-discovered many times): f, Vf, x, 0 > 0, 0 ci 1, search direction d Input : Output: where f(x-sp)-f(x)-cjadTVf(x) end while show that this algorithm terminates in finite time provided dTVf(x) 0, f is bounded below, and f is at least once continuously differentiable