A restart scheme for the memoryless BFGS method

References

• Sun W, Yuan YX. Optimization theory and methods: nonlinear programming. New York (NY): Springer; 2006.
   Google Scholar
• Al-Baali M, Grandinetti L. On practical modifications of the quasi-Newton BFGS method. Adv Model Optim. 2009;11(1):63–76.
   Google Scholar
• Al-Baali M, Spedicato E, Maggioni F. Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems. Optim Methods Softw. 2014;29(5):937–954.
   Web of Science ®Google Scholar
• Andrei N. Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Optim Methods Softw. 2007;22(4):561–571.
   Web of Science ®Google Scholar
• Babaie-Kafaki S, Aminifard Z. Two-parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length. Numer Algorithms. 2019;82(4):1345–1357.
   Web of Science ®Google Scholar
• Li DH, Fukushima M. A modified BFGS method and its global convergence in nonconvex minimization. J Comput Appl Math. 2001;129(1–2):15–35.
   Web of Science ®Google Scholar
• Shanno DF. Conjugate gradient methods with inexact searches. Math Oper Res. 1978;3(3):244–256.
   Google Scholar
• Perry A. A modified conjugate gradient algorithm. Oper Res. 1976;26(6):1073–1078.
   Web of Science ®Google Scholar
• Hestenes MR, Stiefel E. Methods of conjugate gradients for solving linear systems. J Res Natl Bur Stand. 1952;49(6):409–436.
   Google Scholar
• Andrei N. Numerical comparison of conjugate gradient algorithms for unconstrained optimization. Stud Inform Control. 2007;16(4):333–352.
   Google Scholar
• Dai YH, Liao LZ. New conjugacy conditions and related nonlinear conjugate gradient methods. Appl Math Optim. 2001;43(1):87–101.
   Web of Science ®Google Scholar
• Dai YH, Liao LZ, Li D. On restart procedures for the conjugate gradient method. Numer Algorithms. 2004;35(2–4):249–260.
   Web of Science ®Google Scholar
• Powell MJD. Restart procedures for the conjugate gradient method. Math Program. 1977;12(2):241–254.
   Web of Science ®Google Scholar
• Andrei N. Open problems in conjugate gradient algorithms for unconstrained optimization. Bull Malaysian Math Sci Soc. 2011;34(2):319–330.
   Web of Science ®Google Scholar
• Enshaei S, June LW, Farid M. Diagonal quasi-Newton method via variational principle under generalized Frobenius norm. Optim Methods Softw. 2016;31(6):1258–1271.
   Web of Science ®Google Scholar
• Gilbert JC, Lemaréchal C. Some numerical experiments with variable-storage quasi-Newton algorithms. Math Program. 1989;45(1):407–435.
   Google Scholar
• Liu DC, Nocedal J. On the limited memory BFGS method for large-scale optimization. Math Program. 1989;45(3, Ser. B):503–528.
   Web of Science ®Google Scholar
• Fletcher R, Reeves CM. Function minimization by conjugate gradients. Comput J. 1964;7(2):149–154.
   Web of Science ®Google Scholar
• Beale EML. A derivation of conjugate gradients. In Lootsma FA, editor. Numerical methods for nonlinear optimization. New York (NY): Academic Press; 1972. p. 39–43.
   Google Scholar
• Watkins DS. Fundamentals of matrix computations. New York (NY): John Wiley and Sons; 2002.
   Google Scholar
• Babaie-Kafaki S. On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae. J Optim Theory Appl. 2015;167(1):91–101.
   Web of Science ®Google Scholar
• Gilbert JC, Nocedal J. Global convergence properties of conjugate gradient methods for optimization. SIAM J Optim. 1992;2(1):21–42.
   Web of Science ®Google Scholar
• Babaie-Kafaki S. On the sufficient descent property of the Shanno's conjugate gradient method. Optim Lett. 2013;7(4):831–837.
   Web of Science ®Google Scholar
• Babaie-Kafaki S, Aminifard Z. A restart scheme for the Dai–Liao conjugate gradient method by ignoring a direction of maximum magnification by the search direction matrix. RAIRO-Oper Res. 2020;54(4):981–991.
   Web of Science ®Google Scholar
• Sugiki K, Narushima Y, Yabe H. Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization. J Optim Theory Appl. 2012;153(3):733–757.
   Web of Science ®Google Scholar
• Babaie-Kafaki S, Ghanbari R. A modified scaled conjugate gradient method with global convergence for nonconvex functions. Bull Belg Math Soc - Simon Stevin. 2014;21(3):465–477.
   Web of Science ®Google Scholar
• Gould NIM, Orban D, Toint Ph.L. CUTEr: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw. 2003;29(4):373–394.
   Web of Science ®Google Scholar
• Nocedal J, Wright SJ. Numerical optimization. New York (NY): Springer; 2006.
   Google Scholar
• Dolan ED, Moré JJ. Benchmarking optimization software with performance profiles. Math Program. 2002;91(2, Ser. A):201–213.
   Web of Science ®Google Scholar
• Hager WW, Zhang H. Algorithm 851: CG_Descent, a conjugate gradient method with guaranteed descent. ACM Trans Math Softw. 2006;32(1):113–137.
   Web of Science ®Google Scholar