Abstract
A new hybrid of the conjugate gradient (CG) method that combines the features of five different CG methods is proposed. The corresponding CG algorithm generated descent directions independent of line search procedures. With the standard Wolfe line search conditions, the algorithm was shown to be globally convergent. Based on numerical experiments with selected large-scale benchmark test functions and comparison with classical methods, the method is very promising and competitive.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Baali, A.: Descent property and global convergence of the Fletcher-Reeves method with inexact line search. IMA J. Numer. Anal. 5, 121–124 (1985)
Andrei, N.: An unconstrained optimization test functions collection. Adv. Mod. Optim. 10(1), 147–161 (2008)
Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177–182 (1999)
Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. Comput. J. 7, 149–154 (1964)
Hestenes, M.R., Stiefel, E.L.: Method of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409–436 (1952)
Jian, J., Han, L., Jiang, X.: A hybrid conjugate gradient method with descent property for unconstrained optimization. Appl. Math. Model. 39, 1281–1290 (2015)
Jiang, X.Z., Han, L., Jian, J.B.: A globally convergent mixed conjugate gradient method with Wolfe line search. Math. Numer. Sin. 34, 103–112 (2012)
Li, X., Zhao, X.: A hybrid conjugate gradient method for optimization problems. Natural Sci. 3(1), 85–90 (2011)
Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, Part 1: theory. J. Optim. Theory Appl. 69, 129–137 (1991)
Polak, E., Ribiére, E.: Note sur la convergence de directions conjugeés, Rev. Francaise Informat Recherche Operationelle, 3e Année, 16, pp. 35–43 (1969)
Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comp. Math. Math. Phys. 9, 94–112 (1969)
Wei, Z., Yao, S., Liu, L.: The convergence properties of some new conjugate gradient methods. Appl. Math. Comput. 183, 1341–1350 (2006). https://doi.org/10.1016/j.amc.2006.05.150
Yao, S.W., Wei, Z.X., Huang, H.: Note bout WYL’s conjugate gradient method and its application. Appl. Math. Comput. 191, 381–388 (2007)
Zoutendijk, G.: Nonlinear programming, Computational methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 37–86. North-Holland, Amsterdam (1970)
Acknowledgments
The support of the DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) towards this research is hereby acknowledged. Opinions expressed and conclusions arrived at, are those of the authors and are not necessarily to be attributed to the CoE. The authors also wish to appreciate Covenant University Centre for Research, Innovation and Discovery (CUCRID) for funding the publication of this research output.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Oladepo, D.A., Adeleke, O.J., Ako, C.T. (2019). A Mixed Hybrid Conjugate Gradient Method for Unconstrained Engineering Optimization Problems. In: Silhavy, R. (eds) Cybernetics and Algorithms in Intelligent Systems . CSOC2018 2018. Advances in Intelligent Systems and Computing, vol 765. Springer, Cham. https://doi.org/10.1007/978-3-319-91192-2_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-91192-2_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91191-5
Online ISBN: 978-3-319-91192-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)