2017/11/22 by Asl, Azam, Overton, Michael L. · 1 citation
#FOS: Mathematics #Numerical Analysis (math.NA) #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.1711.08517
It has long been known that the gradient (steepest descent) method may fail on nonsmooth problems, but the examples that have appeared in the literature are either devised specifically to defeat a gradient or subgradient method with an exact line search or are unstable with respect to perturbation of the initial point. We give an analysis of the gradient method with steplengths satisfying the Armijo and Wolfe inexact line search conditions on the nonsmooth convex function f(x) = a|x(1)| + ∑i=2n x(i). We show that if a is sufficiently large, satisfying a condition that depends only on the Armijo parameter, then, when the method is initiated at any point x0 ∈ \Rn with x(1)0\not = 0, the iterates converge to a point x with x(1)=0, although f is unbounded below. We also give conditions under which the iterates f(xk)→-∞, using a specific Armijo-Wolfe bracketing line search. Our experimental results demonstrate that our analysis is reasonably tight.