An efficient adaptive trust-region method for systems of nonlinear equations

References

• M. Ahookhosh and K. Amini, A nonmonotone trust region method with adaptive radius for unconstrained optimization, Comput. Math. Appl. 60 (2010), pp. 411–422. doi: 10.1016/j.camwa.2010.04.034
   Web of Science ®Google Scholar
• M. Ahookhosh, H. Esmaeili, and M. Kimiaei, An effective trust-region-based approach for symmetric nonlinear systems, Int. J. Comput. Math. 90(3) (2013), pp. 671–690. doi: 10.1080/00207160.2012.736617
   Google Scholar
• A. Bouaricha and R.B. Schnabel, Tensor methods for large sparse systems of nonlinear equations, Math. Program. 82 (1998), pp. 377–400. doi: 10.1007/BF01580076
   Web of Science ®Google Scholar
• C.G. Broyden, The convergence of an algorithm for solving sparse nonlinear systems, Math. Comput. 25(114) (1971), pp. 285–294. doi: 10.1090/S0025-5718-1971-0297122-5
   Web of Science ®Google Scholar
• S. Buhmiler, N. Krejić, and Z. Lužanin, Practical quasi-Newton algorithms for singular nonlinear systems, Numer. Algorithm 55 (2010), pp. 481–502. doi: 10.1007/s11075-010-9367-z
   Web of Science ®Google Scholar
• A.R. Conn, N.I.M. Gould, and Ph.L. Toint, Trust-Region Methods, Society for Industrial and Applied Mathematics SIAM, Philadelphia, PA, 2000.
   Google Scholar
• J.E. Dennis, On the convergence of Broyden's method for nonlinear systems of equations, Math. Comput. 25(115) (1971), pp. 559–567. doi: 10.1090/S0025-5718-1971-0295560-8
   Web of Science ®Google Scholar
• E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), pp. 201–213. doi: 10.1007/s101070100263
   Web of Science ®Google Scholar
• J.Y. Fan, Convergence rate of the trust region method for nonlinear equations under local error bound condition, Comput. Optim. Appl. 34 (2005), pp. 215–227.
   Web of Science ®Google Scholar
• J.Y. Fan, An improved trust region algorithm for nonlinear equations, Comput. Optim. Appl. 48(1) (2011), pp. 59–70. doi: 10.1007/s10589-009-9236-7
   Web of Science ®Google Scholar
• J.Y. Fan, The modified Levenberg–Marquardt method for nonlinear equations with cubic convergence, Math. Comput. 81 (2012), pp. 447–466. doi: 10.1090/S0025-5718-2011-02496-8
   Web of Science ®Google Scholar
• J.Y. Fan and J.Y, Pan, A modified trust region algorithm for nonlinear equations with new updating rule of trust region radius, Int. J. Comput. Math. 87(14) (2010), pp. 3186–3195. doi: 10.1080/00207160802691645
   Web of Science ®Google Scholar
• J.Y. Fan and Y.X. Yuan, On the quadratic convergence of the Levenberg–Marquardt method without nonsingularity assumption, Computing 74 (2005), pp. 23–39. doi: 10.1007/s00607-004-0083-1
   Web of Science ®Google Scholar
• A. Griewank, The global convergence of Broyden-like methods with a suitable line search, J. Aust. Math. Soc. Ser. B 28 (1986), pp. 75–92. doi: 10.1017/S0334270000005208
   Google Scholar
• L. Grippo and M. Sciandrone, Nonmonotone derivative-free methods for nonlinear equations, Comput. Optim. Appl. 37 (2007), pp. 297–328.
   Web of Science ®Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal. 23 (1986), pp. 707–716. doi: 10.1137/0723046
   Web of Science ®Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi, A truncated Newton method with nonmonotone line search for unconstrained optimization, J. Optim. Theory Appl. 60(3) (1989), pp. 401–419. doi: 10.1007/BF00940345
   Web of Science ®Google Scholar
• G.Z. Gu, D.H. Li, L. Qi, and S.Z. Zhou, Descent directions of quasi-Newton methods for symmetric nonlinear equations, SIAM J. Numer. Anal. 40(5) (2003), pp. 1763–1774. doi: 10.1137/S0036142901397423
   Web of Science ®Google Scholar
• W. La Cruz, J.M. Martínez, and M. Raydan, Spectral residual method without gradient information for solving large-scale nonlinear systems of equations. Math. Comput. 75 (2006), pp. 1449–1466. doi: 10.1090/S0025-5718-06-01836-9
   Web of Science ®Google Scholar
• K. Levenberg, A method for the solution of certain non-linear problems in least squares, Quart. Appl. Math. 2 (1944), pp. 164–166.
   Google Scholar
• D. Li and M. Fukushima, A global and superlinear convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations, SIAM J. Numer. Anal. 37 (1999), pp. 152–172. doi: 10.1137/S0036142998335704
   Web of Science ®Google Scholar
• Q. Li and D.H. Li, A class of derivative-free methods for large-scale nonlinear monotone equations, IMA J. Numer. Anal. 12 (2011), pp. 1–11.
   Google Scholar
• L. Lukšan and J. Vlček, Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations, J. Optim. Theory Appl. 95(3) (1997), pp. 637–658. doi: 10.1023/A:1022678023392
   Web of Science ®Google Scholar
• L. Lukšan and J. Vlček, Sparse and partially separable test problems for unconstrained and equality constrained optimization, ICS AS CR Report No. V-767, Prague, 1998.
   Google Scholar
• D.W. Marquardt, An algorithm for least-squares estimation of nonlinear parameters, SIAM J. Appl. Math. 11 (1963), pp. 431–441. doi: 10.1137/0111030
   Web of Science ®Google Scholar
• J.M. Martinez, A family of quasi-Newton methods for nonlinear equations with direct secant updates of matrix factorizations, SIAM J. Numer. Anal. 27(4) (1990), pp. 1034–1049. doi: 10.1137/0727061
   Web of Science ®Google Scholar
• J.J. Moré, B.S. Garbow, and K.E. Hillström, Testing unconstrained optimization software, ACM Trans. Math. Softw. 7 (1981), pp. 17–41. doi: 10.1145/355934.355936
   Web of Science ®Google Scholar
• J. Nocedal and S.J. Wright, Numerical Optimization, Springer, New York, 2006.
   Google Scholar
• R.B. Schnabel and P.D. Frank, Tensor methods for nonlinear equations, SIAM J. Numer. Anal. 21(5) (1984), pp. 815–843. doi: 10.1137/0721054
   Web of Science ®Google Scholar
• Ph.L. Toint, Numerical solution of large sets of algebraic nonlinear equations, Math. Comput. 46(173) (1986), pp. 175–189. doi: 10.1090/S0025-5718-1986-0815839-9
   Web of Science ®Google Scholar
• X.J. Tong and L. Qi, On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions, J. Optim. Theory Appl. 123(1) (2004), pp. 187–211. doi: 10.1023/B:JOTA.0000043997.42194.dc
   Web of Science ®Google Scholar
• Y. Yuan, Subspace methods for large scale nonlinear equations and nonlinear least squares, Optim. Eng. 10 (2009), pp. 207–218. doi: 10.1007/s11081-008-9064-0
   Web of Science ®Google Scholar
• G. Yuan, S. Lu, and Z. Wei, A new trust-region method with line search for solving symmetric nonlinear equations, Int. J. Comput. Math. 88(10) (2011), pp. 2109–2123. doi: 10.1080/00207160.2010.526206
   Web of Science ®Google Scholar
• G.L. Yuan, Z.X. Wei, and X.W. Lu, A BFGS trust-region method for nonlinear equations, Computing 92(4) (2011), pp. 317–333.
   Web of Science ®Google Scholar
• H.C. Zhang and W.W. Hager, A nonmonotone line search technique for unconstrained optimization, SIAM J. Optim. 14(4) (2004), pp. 1043–1056. doi: 10.1137/S1052623403428208
   Web of Science ®Google Scholar
• J. Zhang and Y. Wang, A new trust region method for nonlinear equations, Math. Methods Oper. Res. 58 (2003), pp. 283–298. doi: 10.1007/s001860300302
   Web of Science ®Google Scholar
• X.S. Zhang, J.L. Zhang, and L.Z. Liao, An adaptive trust region method and its convergence, Sci. China 45 (2002), pp. 620–631. doi: 10.1007/BF02879698
   Google Scholar