| Ortega J M , Rheinboldt W C. Iterative Solution of Nonlinear Equations in Several Variables~[M]. New York and London: Academic Press, 1970. Nocedal J, Wright S J. Numerical Optimization~[M]. New York: Springer, 1999. Bellavia S, MMacconi M, Morini B. An affine scaling trust region approach to bound constrained nonlinear systems [J]. Applied Numerical Mathematics, 2003, 44: 257-280. Monteiro R D C, Pang J S. A potential reduction Newton method for constrained equations, SIAM Journal on Optimization [J]. 1999, 9: 729-754. Kozakevich D N, Martinez J M, Santos S A. Solving nonlinear system of equation with simple bounded constraints [J]. Journal of Computation and Applied Mathematics, 1997, 16: 215-235. Wang C W, Wang Y J, Xu C L. A projection method for a system of nonlinear monotone equations with convex constraints [J]. Mathematical Methods of Operations Research, 2007, 66: 33-46. Kanzow C, Yamashita N, Fukushima M. Levenberg-Marquardt methods for constrained nonlinear equations with strong local convergence properties [J]. Journal of Computational and Applied Mathematics, 2004, 172: 375-397. Yu Z S. On the global convergence of a levenberg-marquardt method for constrained nonlinear equation [J]. Journal of Applied Mathematics and computing, 2004, 16: 183-194. Yu Z S, Lin J, Sun J, et al. Spectral gradient projection method for monotone nonlinear equations with convex constraints [J]. Applied Numerical Mathematics, 2009, 59: 2416-2423. Xiao Y H , Zhu H. A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing [J]. Journal of Mathematical Analysis and Applications. 2013, 405: 310-319. Grippo L , Lamparillo F , Lucidi S. A nonmonotone line search technique for Newton's method [J]. SIAM Journal on Numerical Analysis, 1986, 23: 707-716. Dai Y H. On the nonmonotone line search [J]. Journal of Optimization Theory and Applications, 2002, 112: 315-330. Ulbrich M. Nonmonotone trust region method for bound-constrained semismooth equation with application to mixed complementarity problems [J]. SIAM Journal on Optimization, 2001, 11: 889-917. Zhou W J. On the convergence of the modified Levenberg-Marquardt method with a nonmonotone second order Armijo type line search [J]. Journal of Computational and Applied Mathematics, 2013, 239: 152-161. Maciel M C, Mendonca M G, Verdiell A B. Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems [J]. Computational Optimization and Applications, 2013, 54: 27-43. Ou Y G, Liu Y Y. An ODE-based nonmonotone method for unconstrained optimization problems [J]. Journal of Applied Mathematics and Computing, 2013, 42: 351-369. Zhang H C, Hager W W. A nonmonotone line search technique and its application to unconstrained optimization [J]. SIAM Journal on Optimization, 2004, 14: 1043-1056. Hu S L, Huang Z H, Lu N. A nonmonotone line search algorithm for unconstrained optimization [J]. Journal of Scientific Computing, 2010, 42: 38-53. Cui Z C, Wu B Y. A new modified nonmonotone adaptive trust region method for unconstrained optimization [J]. Computational Optimization and Applications, 2012, 53: 795-806. Gu N Z, Mo J T. Incorporating nonmonotone strategies into the trust region method for unconstrained optimization [J], Computers and Mathematics with Applications, 2008, 55: 2158-2172. Fan J Y, Yuan Y X. On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption [J]. Computing, 2005, 74: 23-39. Fan J Y. On the Levenberg-Marquardt methods for convex constrained nonlinear equations [J]. Journal of Industrial and Management Optimization, 2013, 9: 227-241. More J J, Garbow B S, Hillstrom K E. Testing unconstrained optimization software [J]. ACM transactors on mathematical software, 1981, 7: 136-140. Dolan E D, More J J. Benchmarking optimization software with performance profiles [J]. Mathematical Programming (Serial A), 2002, 91: 201-213. |
