A New Conjugate Gradient Method with Sufficient Descent Property

  • O.B. Akinduko Department of Mathematical Sciences, Adekunle Ajasin University, Akungba-Akoko, Nigeria
Keywords: conjugate gradient method, line search, sufficient descent property, unconstrained optimization, numerical experiment

Abstract

In this paper, by linearly combining the numerator and denominator terms of the Dai-Liao (DL) and Bamigbola-Ali-Nwaeze (BAN) conjugate gradient methods (CGMs), a general form of DL-BAN method has been proposed. From this general form, a new hybrid CGM, which was found to possess a sufficient descent property is generated. Numerical experiment was carried out on the new CGM in comparison with four existing CGMs, using some set of large scale unconstrained optimization problems. The result showed a superior performance of new method over majority of the existing methods.

References

N. Andrei, An unconstrained optimization test functions collection, Adv. Model. Optim. 10(1) (2008), 147-161.

O.M. Bamigbola, M. Ali and E. Nwaeze, An efficient and convergent method for unconstrained nonlinear optimization, Proceedings of International Congress of Mathematicians, Hyderabad, India, 2010.

Edwin K.P. Chong and Stanislaw H. Zak, An Introduction to Optimization, 2nd ed., New York: John Wiley & Sons, Inc., 2001

Y.H. Dai and L.Z. Liao, New conjugacy conditions and related nonlinear conjugate gradient methods, Appl. Math. Optim. 43 (2001), 87-101. https://doi.org/10.1007/s002450010019

S.S. Djordjevic, New hybrid conjugate gradient method as a convex combination of Ls and Fr methods, Acta Math. Sci. 39(1) (2019), 214-228. https://doi.org/10.1007/s10473-019-0117-6

E.D. Dolan and J.J. More, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), 201-213. https://doi.org/10.1007/s101070100263

R. Fletcher and C.M. Reeves, Function minimization by conjugate gradients, The Computer Journal 7 (1964), 149-154. https://doi.org/10.1093/comjnl/7.2.149

R. Fletcher, Practical Methods of Optimization, 2nd ed., Chichester: John Wiley, 1987.

M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards 49 (1952), 409-436. https://doi.org/10.6028/jres.049.044

X. Li and X. Zhao, A hybrid conjugate gradient method for optimization problems, Natural Science 3 (2011), 85-90. https://doi.org/10.4236/ns.2011.31012

O.L. Mangasarian, Nonlinear Programming, New York: McGraw-Hill, 1969.

J.L. Nazareth, Conjugate Gradient Methods, in: Encyclopedia of Optimization (C.A. Floudas and P.M. Pardalos, Editors), Kluwer Academic Publishers, Boston, 1999.

J. Nocedal, Theory of algorithms for unconstrained optimization, Acta Numerica 1 (1992), 199-242. https://doi.org/10.1017/S0962492900002270

I.A. Osinuga and I.O. Olofin, Extended hybrid conjugate gradient method for unconstrained optimization, Journal of Computer Science and its Application 25 (2018), 25-33.

X. Xu and Fy. Kong, New hybrid conjugate gradient methods with the generalized Wolfe line search, SpringerPlus 5 (2016), Article number: 881. https://doi.org/10.1186/s40064-016-2522-9

Published
2021-02-24
How to Cite
Akinduko, O. (2021). A New Conjugate Gradient Method with Sufficient Descent Property. Earthline Journal of Mathematical Sciences, 6(1), 163-174. https://doi.org/10.34198/ejms.6121.163174
Section
Articles