| 1 |
\begin{thebibliography}{1} |
| 2 |
|
| 3 |
\bibitem{foster2019complexity} |
| 4 |
Dylan~J Foster, Ayush Sekhari, Ohad Shamir, Nathan Srebro, Karthik Sridharan, |
| 5 |
and Blake Woodworth. |
| 6 |
\newblock The complexity of making the gradient small in stochastic convex |
| 7 |
optimization. |
| 8 |
\newblock In {\em Conference on Learning Theory}, pages 1319--1345. PMLR, 2019. |
| 9 |
|
| 10 |
\bibitem{globook} |
| 11 |
R.~Horst and H.~Tuy. |
| 12 |
\newblock {\em Global Optimization: Deterministic Approaches}. |
| 13 |
\newblock Springer-Verlag. |
| 14 |
|
| 15 |
\bibitem{nest} |
| 16 |
Y.~Nesterov. |
| 17 |
\newblock {\em Introductory Lectures on Convex Optimization A Basic Course}. |
| 18 |
\newblock Kluwer Academic Publishers. |
| 19 |
|
| 20 |
\bibitem{pour} |
| 21 |
M.~Pour-El and J.~Richards. |
| 22 |
\newblock {\em Computability in analysis and physics}. |
| 23 |
\newblock Springer, Heidelberg, 1989. |
| 24 |
|
| 25 |
\bibitem{sorbook} |
| 26 |
R.I. Soare. |
| 27 |
\newblock {\em Turing Computability: Theory and Applications}. |
| 28 |
\newblock Springer-Verlag. |
| 29 |
|
| 30 |
\bibitem{zhang2020complexity} |
| 31 |
Jingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Suvrit Sra, and Ali Jadbabaie. |
| 32 |
\newblock Complexity of finding stationary points of nonconvex nonsmooth |
| 33 |
functions. |
| 34 |
\newblock In {\em International Conference on Machine Learning}, pages |
| 35 |
11173--11182. PMLR, 2020. |
| 36 |
|
| 37 |
\end{thebibliography} |