[10] Charles G. Broyden. On the discovery of the "good Broyden" method. Mathematical programming, 87:209-213, 2000.
[11] Charles G. Broyden, J. E. Dennis, and Jorge J. Moré. On the local and superlinear convergence of quasi-Newton methods. IMA Journal of Applied Mathematics, 12(3):223–245, 1973.
[12] Caterina Buizza, César Quilodrán Casas, Philip Nadler, Julian Mack, Stefano Marrone, Zainab Titus, Clémence Le Cornec, Evelyn Heylen, Tolga Dur, Luis Baca Ruiz, et al. Data learning: integrating data assimilation and machine learning. Journal of Computational Science, 58: 101525, 2022.
[13] Richard H. Byrd, Jorge Nocedal, and Ya-Xiang Yuan. Global convergence of a cass of quasiNewton methods on convex problems. SIAM Journal on Numerical Analysis, 24(5):1171-1190, 1987.
[14] Timothy A. Davis. Block matrix methods: Taking advantage of high-performance computers. Technical report, Technical Report TR-98-024, 1998.
[15] Alexandre Défossez and Francis Bach. Averaged least-mean-squares: Bias-variance trade-offs and optimal sampling distributions. In Artificial Intelligence and Statistics, pages 205-213. PMLR, 2015.
[16] John E. Dennis Jr and Robert B. Schnabel. Numerical methods for unconstrained optimization and nonlinear equations. SIAM, 1996.
[17] Jin-yan Fan and Ya-Xiang Yuan. On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption. Computing, 74:23-39, 2005.
[18] J. Frehse and A. Bensoussan. Nonlinear elliptic systems in stochastic game theory. Journal für die reine und angewandte Mathematik, 350:23-67, 1984.
[19] Philip E. Gill and Walter Murray. Algorithms for the solution of the nonlinear least-squares problem. SIAM Journal on Numerical Analysis, 15(5):977-992, 1978.
[20] Nick Gould, Dominique Orban, and Philippe Toint. Numerical methods for large-scale nonlinear optimization. Acta Numerica, 14:299-361, 2005.
[21] Robert M. Gower and Peter Richtárik. Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms. arXiv preprint arXiv:1602.01768, 2016.
[22] Andreas Griewank. Broyden updating, the good and the bad. Optimization Stories, Documenta Mathematica. Extra Volume: Optimization Stories, pages 301-315, 2012.
[23] Ruichen Jiang, Qiujiang Jin, and Aryan Mokhtari. Online learning guided curvature approximation: A quasi-Newton method with global non-asymptotic superlinear convergence. In Annual Conference Computational Learning Theory, 2023.
[24] Qiujiang Jin and Aryan Mokhtari. Non-asymptotic superlinear convergence of standard quasi-Newton methods. Mathematical Programming, pages 1–49, 2022.
[25] Carl T. Kelley. Iterative methods for linear and nonlinear equations. SIAM, 1995.
[26] Carl T. Kelley. Solving nonlinear equations with Newton's method. SIAM, 2003.
[27] Carl T. Kelley and Ekkehard W. Sachs. A new proof of superlinear convergence for Broyden's method in Hilbert space. SIAM Journal on Optimization, 1(1):146-150, 1991.
[28] Kenneth Levenberg. A method for the solution of certain non-linear problems in least squares. Quarterly of applied mathematics, 2(2):164-168, 1944.
[29] Dachao Lin, Haishan Ye, and Zhihua Zhang. Explicit superlinear convergence rates of Broyden's methods in nonlinear equations. arXiv preprint arXiv:2109.01974, 2021.
[30] Dachao Lin, Haishan Ye, and Zhihua Zhang. Explicit convergence rates of greedy and random quasi-Newton methods. Journal of Machine Learning Research, 23(162):1-40, 2022.