[1] Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223-311(2018)
[2] Johnson, R. and Ahang, T.:Accelerating stochastic gradient descent using predictive variance reduction, In: Advances in Neural Information Processing Systems 26, pp. 315-323. Curran Associates, Inc. (2013)
[3] Defazio, A., Bach, F., and Lacoste-Julien, S.: SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In: Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, editors, Advances in Neural Information Processing Systems 27, pp. 1646-1654. Curran Associates, Inc. (2014)
[4] Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Optim. 26(2), 1008-1031(2016)
[5] Mokhtari, A., Ribeiro, A.: Res: Regularized stochastic BFGS algorithm. IEEE Trans. Signal Process. 62(23), 6089-6104(2014)
[6] Da Silva, I.N.; Spatti, D.H.; Flauzino, R.A.; Liboni, L.H.B.; dos Reis Alves, S.F. Artificial Neural Networks: A Practical Course. Springer International Publishing, Basel (2016)
[7] Yu, H., Wilamowski, B.M.: Levenberg-Marquardt training. In: Intelligent systems, pp. 1-12. CRC Press, Boca Raton (2018)
[8] Bellavia, S., Riccietti, E.: On an elliptical trust-region procedure for ill-posed nonlinear leastsquares problems. J. Optim. Theory Appl. 178(3), 824-859(2018)
[9] Bidabadi, N.: Using a spectral scaling structured BFGSmethod for constrained nonlinear least squares. Optim. Methods Softw. 34(4), 693-706(2019)
[10] Gould, N.I.M., Rees, T., Scott, J.A.: Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. Comput. Optim. Appl. 73(1), 1-35(2019)
[11] Yuan, Y.X.: Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim. Eng. 10(2), 207-218(2009)
[12] Zhang, H.C., Conn, A.R., Scheinberg, K.: A derivative-free algorithm for least squares minimization. SIAM J. Optim. 20(6), 3555-3576(2010)
[13] Cartis, C., Roberts, L.: A derivative-free Gauss-Newton method. Math. Program. Comput. 11(4), 631-674(2019)
[14] Cartis, C., Fiala, J., Marteau, B., Rober, L.: Improving the flexibility and robustness of modelbased derivative-free optimization solvers. ACM Trans. Math. Software 45(3), 41(2019)
[15] Bergou, E., Gratton, S., Vicente, L.N.: Levenberg-Marquardt methods based on probabilistic gradient models and inexact subproblem solution, with application to data assimilation. SIAM/ASA J. Uncertain. Quantif. 4(1), 924-951(2016)
[16] Zhao, R.X., Fan, J.Y.: Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations. Comput. Optim. Appl. 83, 381-401(2022)
[17] Conn, A. R., Gould, N. I. M., Toint, Ph. L.: Trust-Region Methods. SIAM, Philadelphia (2000)
[18] Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 2, pp. 1-27. Academic Press, New York (1975)
[19] Çinlar, E., and ðCınlar, E.: Probability and Stochastics. Springer, vol. 261(2011)
[20] R. Durrett. Probability: theory and examples. Cambridge University Press, Cambridge (2019)
[21] Laha, R.G., Rohatgi, V.K.: Probability Theory. Courier Dover Publications, New York (2020)
[22] Hong, Y., Bergou, H., Doucet, N., Zhang, H., Cranney, J., Ltaief, H., Gratadour, D., Rigaut, F., and Keyes, D. E.: Stochastic Levenberg-Marquardt for solving optimization problems on hardware accelerators. https://repository.kaust.edu.sa/items/60c86d63-8d42-470a-b875-dd88df1980ff(2021)
[23] Bergou, E., Diouane, Y., Kungurtsev V., and Royer, C. W.: A stochastic Levenberg-Marquardt method using random models with application to data assimilation. arXiv:1807.02176v1(2018)
[24] Moré, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. (TOMS) 7(1), 17-41(1981)
[25] Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(27), 1-27(2011)
