[1] M. Ahookhosh, K. Amini, An efficient nonmonotone trust-region method for unconstrained optimization,
Numer. Algorithms. 59 (2012) 523–540.
[2] M. Ahookhosh, K. Amini, A nonmonotone trust region method with adaptive radius for unconstrained
optimization, Comput. Math. Appl. 60(2010) 411–422.
[3] M. Ahookhosh, K. Amini, M.R. Peyghami, A nonmonotone trust-region line search method for large-scale
unconstrained optimization, Appl. Math. Model. 36 (2012) 478–487.
[4] F. Bastin, V. Malmedy, M. Mouffe, Ph.L. Toint , D. Tomanos, A retrospective trust-region method for
unconstrained optimization, Math. Program. 123 (2010) 395–418.
[5] I. Bongartz, A.R. Conn, N.I.M. Gould, Ph.L. Toint, CUTE: constrained and unconstrained testing environ-
ments, ACM Trans. Math. Software 21 (1995) 123–160.
[6] R.M. Chamberlain, M.J.D. Powell, C. Lemarechal, H.C. Pedersen, The watchdog technique for forcing
convergence in algorithms for constrained optimization, Math. Program. 16 (1982) 1–17.
[7] A.R. Conn, N.I.M. Gould, Ph. L. Toint, LANCELOT: A Fortran Package for Large-Scale Nonlinear Opti-
mization (Release A), (Springer Verlag, Series on Computational Mathematics (17), Berlin, 1992.
[8] A.R. Conn, N.I.M. Gould, Ph.L. Toint, Trust-Region Methods, SIAM, Philadelphia PA, 2000.
[9] E. Dolan, J.J. Mor´e, Benchmarking optimization software with performance profiles, Math. Program. 91
(2002) 201–213.
[10] N.I.M. Gould, D. Orban, Ph.L. Toint, CUTEr: A constrained and unconstrained testing environment, revis-
ited, ACM Trans. Math. Softw. 29 (2003) 373–394.
[11] N.I.M Gould, D. Orban, A. Sartenaer, Ph.L. Toint, Sentesivity of trust-region algorithms to their parameters,
4OR 3 (2005) 227–241.
[12] L. Grippo, F. Lampariello, S. Lucidi, A nonmonotone line search technique for Newton’s method, SIAM J.
Numer. Anal. 23 (1986) 707–716.
[13] L. Grippo, F. Lampariello, S. Lucidi, A truncated Newton method with nonmonotone line search for uncon-
strained optimization, J. Optim. Theory. Appl. 60 (1989) 401–419.
[14] L. Grippo, F. Lampariello, S. Lucidi, A class of nonmonotone stabilization methods in unconstrained opti-
mization, Numer. Math. 59 (1991) 779–805.
[15] K. Levenberg, A method for the solution of certain non-linear problems in least squares, Q. Appl. Math. 2
(1944) 164–166.
[16] D.W. Marquardt, An algorithm for least-squares estimation of nonlinear parameters, SIAM J. Appl. Math.
11 (1963) 431–441.
[17] J. Mo, C. Liu, S. Yan, A nonmonotone trust region method based on nonincreasing technique of weighted
average of the succesive function value, J. Comput. Appl. Math. 209 (2007) 97–108.
[18] J.J. Mor´e, B.S. Garbow, K.E. Hillstrom, Testing unconstrained optimization software, ACM Trans. Math.
Softw. 7 (1981) 17–41.
[19] J. Nocedal, Y. Yuan, Combining trust region and line search techniques, in: Y. Yuan(Ed.), Advanced in
Nonliear Programming (Kluwer), (1998) 153–175.
[20] J. Nocedal, S.J. Wright, Numerical Optimization, Springer, New York, 2006.
[21] M.J.D. Powell, A new algorithm for unconstrained optimization, In: J.B. Rosen, O.L. Mangassarian and K.
Ritter (eds.), Nonlinear Programming, Academic Press, New York (1970) 31–66.
[22] Ph.L. Toint, An assessment of nonmonotone linesearch technique for unconstrained optimization, SIAM J.
Sci. Comput. 17 (1996) 725–739.
[23] H.C. Zhang, W.W. Hager, A nonmonotone line search technique for unconstrained optimization, SIAM J.
Optim. 14 (2004) 1043–1056.
)