References

M. K. Transtrum and J. P. Sethna. Improvements to the Levenberg-Marquardt algorithm for nonlinear least-squares minimization, arXiv preprint arXiv:1201.5885 (2012).↩¹↩²↩³↩⁴↩⁵↩⁶↩⁷↩⁸↩⁹

W. La Cruz, J. Martı́nez and M. Raydan. Spectral residual method without gradient information for solving large-scale nonlinear systems of equations. Mathematics of computation 75, 1429–1448 (2006).↩¹↩²

C. G. Broyden. A class of methods for solving nonlinear simultaneous equations. Mathematics of computation 19, 577–593 (1965).↩¹↩²↩³

J. Klement. On using quasi-newton algorithms of the Broyden class for model-to-test correlation. Journal of Aerospace Technology and Management 6, 407–414 (2014).↩¹↩²

M. Ziani and F. Guyomarc’h. An autoadaptative limited memory Broyden’s method to solve systems of nonlinear equations. Applied mathematics and computation 205, 202–211 (2008).↩¹

Y.-x. Yuan. Recent advances in trust region algorithms. Mathematical Programming 151, 249–281 (2015).↩¹↩²

T. S. Coffey, C. T. Kelley and D. E. Keyes. Pseudotransient continuation and differential-algebraic equations. SIAM Journal on Scientific Computing 25, 553–569 (2003).↩¹↩²

C. T. Kelley and D. E. Keyes. Convergence analysis of pseudo-transient continuation. SIAM Journal on Numerical Analysis 35, 508–523 (1998).↩¹↩²

S. C. Eisenstat and H. F. Walker. Choosing the forcing terms in an inexact Newton method. SIAM Journal on Scientific Computing 17, 16–32 (1996).↩¹

L. Hei. A self-adaptive trust region algorithm. Journal of Computational Mathematics, 229–236 (2003).↩¹

F. Bastin, V. Malmedy, M. Mouffe, P. L. Toint and D. Tomanos. A retrospective trust-region method for unconstrained optimization. Mathematical programming 123, 395–418 (2010).↩¹

J. Fan. Convergence rate of the trust region method for nonlinear equations under local error bound condition. Computational Optimization and Applications 34, 215–227 (2006).↩¹

N. Lepage-Saucier. Alternating cyclic extrapolation methods for optimization algorithms, arXiv preprint arXiv:2104.04974 (2021).↩¹↩²↩³