[62] Mingrui Liu, Zhe Li, Xiaoyu Wang, Jinfeng Yi, and Tianbao Yang, Adaptive negative curvature descent with applications in non-convex optimization, Advances in Neural Information Processing Systems 31 (2018), 4858–4867.
[63] Yizhou Liu, Weijie J. Su, and Tongyang Li, On quantum speedups for nonconvex optimization via quantum tunneling walks, Quantum 7 (2023), 1030, arXiv:2209.14501.
[64] Gábor Lugosi and Shahar Mendelson, Mean estimation and regression under heavy-tailed distributions: A survey, Foundations of Computational Mathematics 19 (2019), no. 5, 1145-1190.
[65] Ashley Montanaro, Quantum speedup of Monte Carlo methods, Proceedings of the Royal Society A 471 (2015), no. 2181, 20150301, arXiv:1504.06987.
[66] Katta G. Murty and Santosh N. Kabadi, Some NP-complete problems in quadratic and nonlinear programming, Mathematical Programming: Series A and B 39 (1987), no. 2, 117-129.
[67] Arkadi Nemirovski, Efficient methods in convex programming, Lecture notes (1994).
[68] Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro, Robust stochastic approximation approach to stochastic programming, SIAM Journal on optimization 19 (2009), no. 4, 1574-1609.
[69] Arkadj Semenovivc Nemirovskij and David Borisovich Yudin, Problem complexity and method efficiency in optimization, 1983.
[70] Yurii Nesterov, Introductory lectures on convex optimization: A basic course, vol. 87, Springer Science & Business Media, 2003.
[71] Yurii Nesterov and Boris T. Polyak, Cubic regularization of Newton method and its global performance, Mathematical Programming 108 (2006), no. 1, 177-205.
[72] Boris T. Polyak, Introduction to optimization. Optimization software, Inc., Publications Division, New York 1 (1987), 32.
[73] Shai Shalev-Shwartz, Online learning: Theory, algorithms, and applications, Hebrew University, 2007.
[74] Shai Shalev-Shwartz and Shai Ben-David, Understanding machine learning: From theory to algorithms, Cambridge university press, 2014.
[75] Joran van Apeldoorn and András Gilyén, Improvements in quantum SDP-solving with applications, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019, 1804.05058.
[76] Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf, Quantum SDP-solvers: Better upper and lower bounds, Quantum 4 (2020), 230, 1705.01843.
[77] Blake Woodworth and Nathan Srebro, Lower bound for randomized first order convex optimization, 2017, arXiv:1709.03594.
[78] Yi Xu, Rong Jin, and Tianbao Yang, NEON+: Accelerated gradient methods for extracting negative curvature for non-convex optimization, 2017, arXiv:1712.01033.
[79] Yaodong Yu, Pan Xu, and Quanquan Gu, Third-order smoothness helps: Faster stochastic optimization algorithms for finding local minima, Advances in Neural Information Processing Systems (2018), 4530-4540.
[80] Chenyi Zhang, Jiaqi Leng, and Tongyang Li, Quantum algorithms for escaping from saddle points, Quantum 5 (2021), 529, arXiv:2007.10253.
[81] Chenyi Zhang and Tongyang Li, Escape saddle points by a simple gradient-descent based algorithm, Advances in Neural Information Processing Systems 34 (2021), 8545-8556, arXiv:2111.14069.
[82] Chenyi Zhang and Tongyang Li, Quantum lower bounds for finding stationary points of nonconvex functions, 2022, arXiv:2212.03906.
[83] Xiao Zhang, Lingxiao Wang, Yaodong Yu, and Quanquan Gu, A primal-dual analysis of global optimality in nonconvex low-rank matrix recovery, International Conference on Machine Learning, pp. 5862-5871, PMLR, 2018.