An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization

References

• Birgin EG, Chambouleyron I, Martinez JM. Estimation of the optical constants and the thickness of thin films using unconstrained optimization. J Comput Phys. 1999;151:862–880.
   Web of Science ®Google Scholar
• Ng CK, Liao LZ, Li D. A globally convergent and efficient method for unconstrained discrete-time optimal control. J Global Optim. 2002;22:401–421.
   Web of Science ®Google Scholar
• Magoulas G, Varhatis MN. Adaptive algorithms for neural network supervised learning: a deterministic optimization approach. Int J Bifurcation Chaos. 2006;16(7):1929–1950.
   Web of Science ®Google Scholar
• Peng CC, Magoulas G. Advanced adaptive nonmonotone conjugate gradient training algorithms for recurrent neural networks. Int J Artif Intell Tools. 2008;17(5):963–984.
   Web of Science ®Google Scholar
• Gao H, Zhang HB, Li ZB, et al. A nonmonotone inexact Newton method for unconstrained optimization. Optim Lett. 2015. DOI:10.1007/s11590-015-0976-2.
   Google Scholar
• Grippo L, Lampariello F, Lucidi S. A nonmonotone line search technique for Newton’s method. SIAM J Numer Anal. 1986;23:707–716.
   Web of Science ®Google Scholar
• Hestenes MR, Stiefel EL. Methods of conjugate gradients for solving linear systems. J Res Nat Bureau Stand. 1952;1952:409–436.
   Google Scholar
• Yuan G, Meng Z, Li Y. A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations. J Optim Theory Appl. 2016;168:129–152.
   Web of Science ®Google Scholar
• Yuan G, Zhang M. A three-terms Polak--Ribière--Polyak conjugate gradient algorithm for large-scale nonlinear equations. J Comput Appl Math. 2015;286:186–195.
   Web of Science ®Google Scholar
• Yuan G, Wei Z, Li G. A modified Polak--Ribière--Polyak conjugate gradient algorithm for nonsmooth convex programs. J Comput Appl Math. 2014;255:86–96.
   Web of Science ®Google Scholar
• Yuan G, Wei Z. The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems. Math Model Anal. 2012;17(2):203–216.
   Web of Science ®Google Scholar
• Zhang L, Zhou W, Li DH. A descent modified Polak--Ribière--Polyak conjugate gradient method and its global convergence. IMA J Numer Anal. 2006;26:629–640.
   Web of Science ®Google Scholar
• Akaike H. On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann Inst Stat Math. 1959;11:1–17.
   Web of Science ®Google Scholar
• Barzilai B, Borwein JM. Methods of conjugate gradients for solving linear systems. IMA J Numer Anal. 1988;8:141–148.
   Web of Science ®Google Scholar
• Xiao Y, Wang Q, Wang D. Notes on the Dai--Yuan--Yuan modified spectral gradient method. J Comput Appl Math. 2010;234:2986–2992.
   Web of Science ®Google Scholar
• Raydan M. The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J Optim. 1997;7:26–33.
   Web of Science ®Google Scholar
• Dai YH, Liao LZ. R-linear convergence of the Barzilai and Borwein gradient method. IMA J Numer Anal. 2002;22:1–10.
   Web of Science ®Google Scholar
• Ahookhosh M, Amini K, Bahrami S. A class of nonmonotone Armijo-type line search method for unconstrained optimization. Optim: J Math Program Oper Res. 2012;61(4):387–404.
   Web of Science ®Google Scholar
• Huang S, Wan Z, Chen Z. A new nonmonotone line search technique for unconstrained optimization. Numer Algorithms. 2015;68:671–689.
   Web of Science ®Google Scholar
• Tang J, Dong L, Zhou J, et al. A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search. Optim: J Math Program Oper Res. 2015;64(9):1935–1955.
   Web of Science ®Google Scholar
• Zhang HC, Hager WW. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J Optim. 2004;14(4):1043–1056.
   Web of Science ®Google Scholar
• Grippo L, Sciandrone M. Nonmonotone globalization techniques for the Barzilai--Borwein gradient method. Comput Optim Appl. 2002;23:143–169.
   Web of Science ®Google Scholar
• Fletcher R. Low storage methods for unconstrained optimization. In: Allgower EL, Georg K, editors. Computational solution of nonlinear systems of equations. Lectures in Applied Mathematics (AMS); 1990165–26:179.
   Google Scholar
• Amini K, Ahookhosh M, Nosratipour H. An inexact line search approach using modified nonmonotone strategy for unconstrained optimization. Numer Algorithms. 2014;60(1):49–78.
   Web of Science ®Google Scholar
• Wan Z, Chen Y, Huang S, et al. A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations. Optim Lett. 2004;8(6):11845–1860.
   Google Scholar
• Qi L, Teo K, Yang X. Optimization and control with applications. New York (NY): Springer; 2005.
   Google Scholar
• Plagianakos VP, Magoulas G, Vrahatis MN. Deterministic nonmonotone strategies for effective training of multilayer perceptrons. IEEE Trans Neural Networks. 2002;13(6):1268–1284.
   PubMed Web of Science ®Google Scholar
• Armijo L. Minimization of functions having Lipschitz-continuous first partial derivatives. Pac J Math. 1966;16:1–3.
   Web of Science ®Google Scholar
• Rosenbrock HH. An automatic method for finding the greatest or least value of a function. Comput J. 1960;3:175–184.
   Web of Science ®Google Scholar
• Dai H. On the nonmonotone line search. J Optim Theory Appl. 2002;112(2):315–330.
   Web of Science ®Google Scholar
• Toint PL. An assessment of non-monotone line search techniques for unconstrained optimization. SIAM J Sci Comput. 1996;17:725–739.
   Web of Science ®Google Scholar
• Dai Z, Wen F. Global convergence of a modified Hestenes--Stiefel nonlinear conjugate gradient method with Armijo line search. Numer Algorithms. 2012;59:79–93.
   Web of Science ®Google Scholar
• Hager WW, Zhang H. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim. 2005;16:170–192.
   Web of Science ®Google Scholar
• Gould NIM, Orban D, Toint PL. CUTEr: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw. 2003;29:373–394.
   Web of Science ®Google Scholar
• Dolan E, Moré JJ. Benchmarking optimization software with performance profiles. Math Program. 2002;91:201–213.
   Web of Science ®Google Scholar