Fetching the paper…
Reading the bibliography…
It is well-known that given a smooth, bounded-from-below, and possibly nonconvex function, standard gradient-based methods can find $\epsilon$-stationary points (with gradient norm less than $\epsilon$) in $\mathcal{O}(1/\epsilon^2)$ iterations.
Proximité et dualité dans un espace hilbertien
Jean-Jacques Moreau · 1965
Earlier work this paper cites.
Optimization of lipschitz continuous functions
AA Goldstein · 1977
Earlier work this paper cites.
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadi Semenovich Nemirovski and David Borisovich Yudin · 1983
Earlier work this paper cites.
A remark on regularization in hilbert spaces
Jean-Michel Lasry and Pierre-Louis Lions · 1986
Earlier work this paper cites.
Visual reconstruction
Andrew Blake and Andrew Zisserman · 1987
Earlier work this paper cites.
Optimization and nonsmooth analysis , volume 5
Frank H Clarke · 1990
Earlier work this paper cites.
Approximation and regularization of arbitrary functions in hilbert spaces by the lasry-lions method
Hédy Attouch and Dominique Aze · 1993
Earlier work this paper cites.
Information-based complexity of convex programming
Arkadi Nemirovski · 1995
Earlier work this paper cites.
The effective energy transformation scheme as a special continuation approach to global optimization with application to molecular conformation
Zhijun Wu · 1996
Earlier work this paper cites.
An elementary introduction to modern convex geometry
Keith Ball et al · 1997
Earlier work this paper cites.
Stochastic approximations and differential inclusions
Michel Benaïm, Josef Hofbauer, and Sylvain Sorin · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
Clarke subgradients of stratifiable functions
Jérôme Bolte, Aris Daniilidis, Adrian Lewis, and Masahiro Shiota · 2007
Earlier work this paper cites.
Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization
Krzysztof C Kiwiel · 2007
Cited alongside, same era.
Variational analysis , volume 317
R. Tyrrell Rockafellar and Roger J.B. Wets · 2009
Cited alongside, same era.
Smoothing projected gradient method and its application to stochastic linear complementarity problems
Chao Zhang and Xiaojun Chen · 2009
Cited alongside, same era.
Convex analysis and monotone operator theory in Hilbert spaces , volume 408
Heinz H Bauschke, Patrick L Combettes, et al · 2011
Cited alongside, same era.
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
Coralia Cartis, Nicholas IM Gould, and Philippe L Toint · 2011
Cited alongside, same era.
Smoothing and first order methods: A unified framework
Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory
Gábor Braun, Cristóbal Guzmán, and Sebastian Pokutta · 2017
Later among the works it cites.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Later among the works it cites.
First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems
Jérôme Bolte, Shoham Sabach, Marc Teboulle, and Yakov Vaisbourd · 2018
Later among the works it cites.
Stochastic subgradient method converges on tame functions
Damek Davis, Dmitriy Drusvyatskiy, Sham Kakade, and Jason D Lee · 2018
Later among the works it cites.
Stochastic methods for composite and weakly convex optimization problems
John C Duchi and Feng Ruan · 2018
Later among the works it cites.
Analysis of nonsmooth stochastic approximation: the differential inclusion approach
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Amir Beck and Marc Teboulle · 2012
Cited alongside, same era.
Smoothing methods for nonsmooth, nonconvex minimization
Xiaojun Chen · 2012
Cited alongside, same era.
Randomized smoothing for stochastic optimization
John C Duchi, Peter L Bartlett, and Martin J Wainwright · 2012
Cited alongside, same era.
How to make the gradients small
Yurii Nesterov · 2012
Cited alongside, same era.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Cited alongside, same era.
A theoretical analysis of optimization by gaussian continuation
Hossein Mobahi and John W Fisher III · 2015
Cited alongside, same era.
Optimal black-box reductions between optimization objectives
Zeyuan Allen-Zhu and Elad Hazan · 2016
Cited alongside, same era.
Szymon Majewski, Błażej Miasojedow, and Eric Moulines · 2018
Later among the works it cites.
Lower bounds for finding stationary points i
Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford · 2019
Later among the works it cites.
Stochastic model-based minimization of weakly convex functions
Damek Davis and Dmitriy Drusvyatskiy · 2019
Later among the works it cites.
Efficiency of minimizing compositions of convex functions and smooth maps
Dmitriy Drusvyatskiy and Courtney Paquette · 2019
Later among the works it cites.
On the convergence to stationary points of deterministic and randomized feasible descent directions methods
Amir Beck and Nadav Hallak · 2020
Later among the works it cites.
Complexity of finding stationary points of nonsmooth nonconvex functions
Jingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Suvrit Sra, and Ali Jadbabaie · 2020
Later among the works it cites.
Damek Davis, Dmitriy Drusvyatskiy, Yin Tat Lee, Swati Padmanabhan, and Guanghao Ye · 2022
Closest in time.
On the finite-time complexity and practical computation of approximate stationarity concepts of Lipschitz functions
Lai Tian, Kaiwen Zhou, and Anthony Man-Cho So · 2022
Closest in time.