Dmitriy Drusvyatskiy

Stochastic model-based minimization under high-order growth

2018 · arXiv (Cornell University)

Given a nonsmooth, nonconvex minimization problem, we consider algorithms that iteratively sample and minimize stochastic convex models of the objective function. Assuming that the one-sided approximation quality and the variation of the models is controlled …