Abstract
In this paper, we follow a chronological development of gradient descent methods and its accelerated variants later on. We specifically emphasise some contemporary approaches within this research field. Accordingly, a constructive overview over the class of hybrid accelerated models derived from the three-term hybridization process proposed by Khan is presented. Extensive numerical test results illustrate the performance profiles of hybrid and non-hybrid versions of chosen accelerated gradient models regarding the number of iterations, CPU time, and number of function evaluation metrics. Favorable outcomes justify this hybrid approach as an accepted method in developing new efficient optimization schemes.
Funder
Internal-junior project IJ-0202, Faculty of Sciences and Mathematics, University of Priština in Kosovska Mitrovica
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference35 articles.
1. A survey of numerical methods for unconstrained optimization;SIAM Rev.,1970
2. Andrei, N. (2020). Nonlinear Conjugate Gradient Methods for Unconstrained Optimization, Springer.
3. Nocadal, J., and Wright, S.J. (1999). Numerical Optimization, Springer.
4. Jacoby, S.L.S., Kowalik, J.S., and Pizzo, J.T. (1977). Iterative Methods for Nonlinear Optimization Problems, Prentice-Hall, Inc.
5. Deniss, J.E., Kowalik, J.S., and Schnabel, R.B. (1983). Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献