Research ArticleOpen AccessGoogle Scholar indexed
Three New Hybrid Conjugate Gradient Methods for Optimization
- 1
- 2
- 3
- 4
Copy link · social · email
Abstract
In this paper, three new hybrid nonlinear conjugate gradient methods are presented, which produce suf?cient descent search direction at every iteration. This property is independent of any line search or the convexity of the objective function used. Under suitable conditions, we prove that the proposed methods converge globally for general nonconvex functions. The numerical results show that all these three new hybrid methods are efficient for the given test problems.
KeywordsConjugate Gradient MethodDescent DirectionGlobal Convergence
- R. Fletcher and C. Reeves, “Function Minimization by Conjugate Gradients,” The Computer Journal, Vol. 7, No. 2, 1964, pp. 149-154. doi:10.1093/comjnl/7.2.149
- R. Fletcher, “Practical Methods of Optimization, Unconstrained Optimization,” Wiley, New York, 1987.
- Y. H. Dai and Y. Yuan, “A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property,” SIAM Journal on Optimization, Vol. 10, No. 1, 1999, pp. 177-182. doi:10.1137/S1052623497318992
- M. R. Hestenes and E. L. Stiefel, “Methods of Conjugate Gradients for Solving Linear Systems,” Journal of Research of the National Bureau of Standards, Vol. 49, No. 6, 1952, pp. 409-432.
- B. Polak and G. Ribiere, “Note Surla Convergence des Méthodes de Directions Conjuguées,” Revue Francaise d’Informatique et de Recherche Opérationnelle, Vol. 16, No. 1, 1969, pp. 35-43.
- B. T. Polyak, “The Conjugate Gradient Method in Extreme Problems,” USSR Computational Mathematics and Mathematical Physics, Vol. 9, No. 4, 1969, pp. 94-112. doi:10.1016/0041-5553(69)90035-4
- Y. L. Liu and C. S. Storey, “Efficient Generalized Conjugate Gradient Algorithms, Part 1: Theory,” Journal of Optimization Theory and Applications, Vol. 69, No. 1, 1991, pp. 129-137. doi:10.1007/BF00940464
- Y. Yuan and W. Sun, “Theory and Methods of Optimization,” Science Press of China, Beijing, 1999.
- Y. H. Dai and Y. Yuan, “Nonlinear Conjugate Gradient Methods,” Shanghai Scientific and Technical Publishers, Shanghai, 1998.
- G. Zoutendijk, “Nonlinear Programming, Computational Methods,” In: J. Abadie Ed., Integer and Nonlinear Programming, North-Holland, Amsterdam, 1970, pp. 37-86.
- M. Al-Baali, “Descent Property and Global Convergence of the Fletcher–Reeves Method with Inexact Line Search,” IMA Journal of Numerical Analysis, Vol. 5, No. 1, 1985, pp.121-124. doi:10.1093/imanum/5.1.121
- M. J. D. Powell, “Nonconvex Minimization Calculations and the Conjugate Gradient Method,” Lecture Notes in Mathematics, Vol. 1066, No. 122, 1984, pp. 121-141.
- D. Touati-Ahmed and C. Storey, “Efficient Hybrid Conjugate Gradient Techniques,” Journal of Optimization Theory and Applications, Vol. 64, No. 2, 1990, pp. 379–397. doi:10.1007/BF00939455
- Y. H. Dai and Y. Yuan, “An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization,” Annals of Operations Research, Vol. 103, No. 1-4, 2001, pp. 33-47. doi:10.1023/A:1012930416777