Three-Term Conjugate Gradient (TTCG) methods

Journal of Multidisciplinary Modeling and Optimization

卷:2

关键词: Unconstrained Optimization;    Conjugate Gradient;    Global convergence;   

DOI  :  

来源: DOAJ

【 摘 要 】

In this study, a comprehensive hybrid the formula was developed for some known algorithms of “Three-Term ConjugateGradient (TTCG) methods” for solving problems of unconstrained optimization bycombining the three most important vectors () in a new vector . In addition,it is considered as a special case and as an alternative to the vector  in the generalversions of Yasushi, Yabe, and Ford. Global convergence, sufficient descend andconjugacy were studied in the presence of strong Wolfe. The results proved theefficiency of proposed algorithms than comparative algorithms using 35nonlinear functions.

【 授权许可】

Unknown