A MODIFIED CONJUGATE GRADIENT METHOD WITH GLOBAL-CONVERGENCE FOR UNCONSTRIANED OPTIMIZATION PROBEMS
In this paper a new conjugate gradient method for unconstrained optimization is suggested, the new method is based on Conjugate Descent (CD) formula which is a modified of the CD formula and which is also sufficiently descent and globally convergent. Numerical evidence shows that this new conjugate gradient algorithm is considered as one of the competitive conjugate gradient methods.
Dai, Y. H. and Yuan, Y. (1996). Convergence Properties of the Conjugate Descent Method, Mathematical Advances, 25,552-562.
Dai, Y. H. and Yuan, Y. (2001). A Three-Parameter Family of Nonlinear Conjugate Gradient Methods, Math. Comp., 70, 1155-1167.
Dai, Y. H. and Yuan, Y. (1998). A Class of Globally Convergent Conjugate Gradient Methods, Research report ICM-98-030, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences.
Fletcher, R. (1989). Practical Method of Optimization, ( 2nd ed.), john Wiley , New York.
Fletcher, R. and Reeves (1964). Function Minimization by Conjugate Gradients. published in the computer journal, publisher (Oxford University Press), Colin M, 7, 149-154.
Hager, W. W. and Zhang, H. C. (2006). A Survey of Nonlinear Conjugate Gradient Methods. Pac. J. Optim., 2, 35-58.
It is the policy of the Journal of Duhok University to own the copyright of the technical contributions. It publishes and facilitates the appropriate re-utilize of the published materials by others. Photocopying is permitted with credit and referring to the source for individuals use.
Copyright © 2017. All Rights Reserved.