• 论文 •

### 一种混合的HS-DY共轭梯度法

1. 首都师范大学数学系,首都师范大学数学系 北京 100037 ,北京 100037
• 出版日期:2005-04-14 发布日期:2005-04-14

### A MIXED HS-DY CONJUGATE GRADIENT METHODS

1. Dai Zhifeng Chen Lanping (Department of Mathematics, Capital Normal University, Beijing 100037, China)
• Online:2005-04-14 Published:2005-04-14

In this paper, we propose a mixed conjugate gradient method for unconstrained optimization based on Hestenes-stiefel Algorithms and Dai-Yuan Algorithms, which has taken the advantages of two Algorithms. We prove it can ensure the convergence under the Wolfe line search and without the descent condition. Numerical experiments show that the algorithm is efficient by comparing with HS conjugate gradient methods and PR conjugate gradient methods.

()
 [1] Al-Baali M., Descent Property and global convergence of the Fletcher-Reeves method with inexact line searches IMA Journal of Numerical Analysis, 5:1(1985), 121-124, [2] Gilbert,J.C, Nocedal.J, Global convergence properties of conjugate gradient methods for optimization, SIAM J Optimization, 2(1992), 21-42. [3] Dai.Y.H, Yuan.Y.X A Nonlinear conjugate gradient method with a strong Global convergence propertie, SIAM J Optimization, 10(1999), 177-182. [4] G,Zoutendijk, Nolinear programming, computational Methods, In:Integer and Nolinear programming, Abedie, ed, North-Holland, Amsterdam, 1970, 37-86. [5] Jorge J. More,Burton S. Garbow, and Kenneth E. Hillstrom, Testing Unconstrained Optimization Software ACM Transactions on Mathematical Software, 1-2:7(1981), 17-41. [6] Changyu Wang, Jiye Han, Lei Wang, Global Convergence of the Polak-Ribiere and Hestenes-Stiefel Conjugate Gradient Methods for the Unconstrained Nonlinear Optimization,运筹 学学报,4:3(2000),1—7．
 No related articles found!