A line search proximal subgradient method for nonconvex stochastic optimization
This work introduces a proximal sample-average subgradient method for minimizing the sum of an expected cost, whose integrand is potentially nonsmooth and nonconvex, and a lower semicontinuous, prox-bounded function. We target the class of upper-$C^2$ integrands obeying a nonsmooth, localized variant of the descent lemma in the decision variable, a structural assumption that simultaneously covers … Read more