Nonmonotone Self-adaptive Levenberg–Marquardt Approach for Solving Systems of Nonlinear Equations

References

• M. Ahookhosh and K. Amini (2010). A nonmonotone trust region method with adaptive radius for unconstrained optimization. Comput. Math. Appl. 60:411–422.
   Web of Science ®Google Scholar
• M. Ahookhosh and K. Amini (2012). An efficient nonmonotone trust-region method for unconstrained optimization. Numer. Algorithm 59(4):523–540.
   Web of Science ®Google Scholar
• M. Ahookhosh, H. Esmaeili, and M. Kimiaei (2013). An effective trust-region-based approach for symmetric nonlinear systems. Int. J. Comput. Math. 90(3):671–690.
   Google Scholar
• H. Esmaeili and M. Kimiaei (2015). An effective adaptive trust-region method for systems of nonlinear equations. Int. J. Comput. Math. 92(1):151–166.
   Web of Science ®Google Scholar
• H. Esmaeili and M. Kimiaei (2014). A new adaptive trust-region method for system of nonlinear equations. Appl. Math. Model. 19:469–490.
   Web of Science ®Google Scholar
• A. Bouaricha and R. B. Schnabel (1998). Tensor methods for large sparse systems of nonlinear equations. Math. Prog. 82:377–400.
   Web of Science ®Google Scholar
• C. G. Broyden (1971). The convergence of an algorithm for solving sparse nonlinear systems. Math. Comput. 25(114):285–294.
   Web of Science ®Google Scholar
• S. Buhmiler, N. Krejić, and Z. Lužanin (2010). Practical quasi-Newton algorithms for singular nonlinear systems. Numer. Algorithm 55:481–502.
   Web of Science ®Google Scholar
• A. R. Conn, N. I. M. Gould, and Ph. L. Toint (2000). Trust-Region Methods. Society for Industrial and Applied Mathematics SIAM, Philadelphia.
   Google Scholar
• H. Dan, N. Yamashita, and M. Fukushima (2002). Convergence properties of the inexact Levenberg–Marquardt method under local error bound. Optim. Methods Softw. 17:605–626.
   Web of Science ®Google Scholar
• N. Y. Deng, Y. Xiao, and F. J. Zhou (1993). Nonmonotonic trust region algorithm. J. Optim. Theory Appl. 76:259–285.
   Web of Science ®Google Scholar
• J. E. Dennis (1971). On the convergence of Broyden’s method for nonlinear systems of equations. Math. Comput. 25(115):559–567.
   Web of Science ®Google Scholar
• E. D. Dolan and J. J. Moré (2002). Benchmarking optimization software with performance profiles. Math. Prog. 91:201–213.
   Web of Science ®Google Scholar
• J. Y. Fan (2012). The modified Levenberg–Marquardt method for nonlinear equations with cubic convergence. Math. Comput. 81:447–466.
   Web of Science ®Google Scholar
• J. Y. Fan and J. Y. Pan (2006). Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition. Comput. Optim. Appl. 34:47–62.
   Web of Science ®Google Scholar
• J. Y. Fan (2011). An improved trust region algorithm for nonlinear equations. Comput. Optim. Appl. 48(1):59–70.
   Web of Science ®Google Scholar
• J. Y. Fan and J. Y. Pan (2010). A modified trust region algorithm for nonlinear equations with new updating rule of trust region radius. Int. J. Comput. Math. 87(14):3186-3195.
   Web of Science ®Google Scholar
• J. Y. Fan and Y. X. Yuan (2005). On the quadratic convergence of the Levenberg–Marquardt method without nonsingularity assumption. Computing 74:23–39.
   Web of Science ®Google Scholar
• A. Griewank (1986). The global convergence of Broyden-like methods with a suitable line search. J. Aust. Math. Soc. Ser. B 28:75–92.
   Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi (1986). A nonmonotone line search technique for Newton’s method. SIAM J. Numer. Anal. 23:707–716.
   Web of Science ®Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi (1989). A truncated Newton method with nonmonotone linesearch for unconstrained optimization. J. Optim. Theory Appl. 60(3):401–419.
   Web of Science ®Google Scholar
• L. Grippo and M. Sciandrone (2007). Nonmonotone derivative-free methods for nonlinear equations. Comput. Optim. Appl. 37:297–328.
   Web of Science ®Google Scholar
• G. Z. Gu, D. H. Li, L. Qi, and S. Z. Zhou (2003). Descent directions of Quasi-Newton methods for symmetric nonlinear equations. SIAM J. Numer. Anal. 40(5):1763–1774.
   Web of Science ®Google Scholar
• C. He and C. Ma (2010). A smoothing self-adaptive LevenbergMarquardt algorithm for solving system of nonlinear inequalities. Appl. Math. Comput. 216:3056–3063.
   Web of Science ®Google Scholar
• W. La Cruz, C. Venezuela, J. M. Martínez, and M. Raydan (2004). Spectral residual method without gradient information for solving large-scale nonlinear systems of equations: Theory and experiments, Technical Report RT-04-08, July 2004.
   Google Scholar
• K. Levenberg (1944). A method for the solution of certain non-linear problems in least squares. Quart. Appl. Math. 2:164–166.
   Google Scholar
• Q. Li and D. H. Li (2011). A class of derivative-free methods for large-scale nonlinear monotone equations. IMA J. Numer. Anal. 31(4):1625–1635.
   Web of Science ®Google Scholar
• D. Li and M. Fukushima (1999). A global and superlinear convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations. SIAM J. Numer. Anal. 37:152–172.
   Web of Science ®Google Scholar
• L. Lukšan and J. Vlček (1997). Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations. J. Optim. Theory Appl. 95(3):637–658.
   Web of Science ®Google Scholar
• L. Lukšan and J. Vlček (1999). Sparse and partially separable test problems for unconstrained and equality constrained optimization, Technical Report, No. 767, January 1999.
   Google Scholar
• C. Ma and L. Jiang (2007). Some research on Levenberg-Marquardt method for the nonlinear equations. Appl. Math. Comput. 184:1032–1040.
   Web of Science ®Google Scholar
• D. W. Marquardt (1963). An algorithm for least-squares estimation of nonlinear parameters. J. Ins. Math. Appl. 11:431–441.
   Google Scholar
• J. M. Martinez (1990). A family of quasi-Newton methods for nonlinear equations with direct secant updates of matrix factorizations. SIAM J. Numer. Anal. 27(4):1034–1049.
   Web of Science ®Google Scholar
• J. J. Moré, B. S. Garbow, and K. E. Hillström (1981). Testing unconstrained optimization software. ACM Trans. Math. Softw. 7:17–41.
   Web of Science ®Google Scholar
• J. Nocedal and S. J. Wright (2006). Numerical Optimization. Springer, New York.
   Google Scholar
• M. J. D. Powell (1975). Convergence properties of a class of minimization algorithms. In: Nonlinear Programming 2 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds.). Academic Press, New York, pp. 1–27.
   Google Scholar
• R. B. Schnabel and P. D. Frank (1984). Tensor methods for nonlinear equations. SIAM J. Numer. Anal. 21(5):815–843.
   Web of Science ®Google Scholar
• N. Yamashita and M. Fukushima (2001). On the rate of convergence of the Levenberg–Marquardt method. Computing 15(Suppl):239–249.
   Google Scholar
• G. Yuan, S. Lu, and Z. Wei (2011). A new trust-region method with line search for solving symmetric nonlinear equations. Int. J. Comput. Math. 88(10):2109-2123.
   Web of Science ®Google Scholar
• G. L. Yuan, Z. X. Wei, and X. W. Lu (2011). A BFGS trust-region method for nonlinear equations. Computing 92(4):317–333.
   Web of Science ®Google Scholar
• Y. Yuan (2009). Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim. Eng. 10:207–218.
   Web of Science ®Google Scholar
• H. C. Zhang and W. W. Hager (2004). A nonmonotone line search technique for unconstrained optimization. SIAM J. Optim. 14(4):1043–1056.
   Web of Science ®Google Scholar
• J. Zhang and Y. Wang (2003). A new trust region method for nonlinear equations. Math. Methods Oper. Res. 58:283–298.
   Web of Science ®Google Scholar
• X. S. Zhang, J. L. Zhang, and L. Z. Liao (2002). An adaptive trust region method and its convergence. Sci. China 45:620–631.
   Google Scholar