Three-Term Conjugate Gradient (TTCG) methods

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of Multidisciplinary Modeling and Optimization
Volume:2 Issue:1
Three-Term Conjugate Gradient (TTCG) methods

Three-Term Conjugate Gradient (TTCG) methods

Authors : Zeyad M ABDULLAH, Marwan S JAMEEL

Pages : 16-26

View : 7 | Download : 5

Publication Date : 2019-08-02

Article Type : Research Paper

Abstract :In this study, a comprehensive hybrid the formula was developed for some known algorithms of “Three-Term Conjugate Gradient insert ignore into journalissuearticles values(TTCG); methods” for solving problems of unconstrained optimization by combining the three most important vectors insert ignore into journalissuearticles values( ); in a new vector . In addition, it is considered as a special case and as an alternative to the vector in the general versions of Yasushi, Yabe, and Ford. Global convergence, sufficient descend and conjugacy were studied in the presence of strong Wolfe. The results proved the efficiency of proposed algorithms than comparative algorithms using 35 nonlinear functions .
Keywords : Unconstrained Optimization, Conjugate Gradient, Global convergence

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.