[18] Anton Rodomanov and Yurii Nesterov. New results on superlinear convergence of classical quasi-newton methods. Journal of Optimization Theory and Applications, 188(3):744-769, 2021.
[19] Qiujiang Jin and Aryan Mokhtari. Non-asymptotic superlinear convergence of standard quasi-newton methods. Mathematical Programming, 2022.
[20] Qiujiang Jin, Alec Koppel, Ketan Rajawat, and Aryan Mokhtari. Sharpened quasi-Newton methods: Faster superlinear rate and larger local convergence neighborhood. In Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pages 10228–10250. PMLR, 2022.
[21] Dachao Lin, Haishan Ye, and Zhihua Zhang. Greedy and random quasi-newton methods with faster explicit superlinear convergence. Advances in Neural Information Processing Systems, 34:6646-6657, 2021.
[22] Haishan Ye, Dachao Lin, Xiangyu Chang, and Zhihua Zhang. Towards explicit superlinear convergence rate for sr1. Mathematical Programming, pages 1-31, 2022.
[23] Yurii Nesterov. A method of solving a convex programming problem with convergence rate  $\mathcal{O}(1 / k^2)$ . Soviet Mathematics Doklady, pages 372-376, 1983.
[24] M.J.D. Powell. Some properties of the variable metric algorithm. Numerical methods for nonlinear optimization, pages 1-17, 1972.
[25] Katya Scheinberg and Xiaocheng Tang. Practical inexact proximal quasi-newton method with global complexity analysis. Mathematical Programming, 160:495-529, 2016.
[26] Hiva Ghanbari and Katya Scheinberg. Proximal quasi-newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Computational Optimization and Applications, 69:597-627, 2018.
[27] Dmitry Kamzolov, Klea Ziu, Artem Agafonov, and Martin Takáč. Accelerated adaptive cubic regularized quasi-newton methods. arXiv preprint arXiv:2302.04987, 2023.
[28] A. Nemirovski and D. Yudin. Problem Complexity and Method Efficiency in Optimization. Wiley, 1983.
[29] Yuri Nesterov. Lectures on Convex Optimization. Springer International Publishing, 2018.
[30] Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford. Lower bounds for finding stationary points i. Mathematical Programming, 184(1-2):71-120, 2020.
[31] Renato DC Monteiro and Benar Fux Svaiter. An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods. SIAM Journal on Optimization, 23(2):1092-1125, 2013.
[32] Yair Carmon, Danielle Hausler, Arun Jambulapati, Yujia Jin, and Aaron Sidford. Optimal and adaptive monteiro-svaiter acceleration. In Advances in Neural Information Processing Systems, 2022.
[33] Osman Güler. New proximal point algorithms for convex minimization. SIAM Journal on Optimization, 2(4):649-664, 1992.
[34] Saverio Salzo and Silvia Villa. Inexact and accelerated proximal point algorithms. Journal of Convex analysis, 19(4):1167-1192, 2012.
[35] Ruichen Jiang, Qiujiang Jin, and Aryan Mokhtari. Online learning guided curvature approximation: A quasi-newton method with global non-asymptotic superlinear convergence. arXiv preprint arXiv:2302.08580, 2023.
[36] D. Newman. Location of the maximum on unimodal surfaces. Journal of the ACM, 12(3):395-398, 1965.