IAD Index of Academic Documents
  • Home Page
  • About
    • About Izmir Academy Association
    • About IAD Index
    • IAD Team
    • IAD Logos and Links
    • Policies
    • Contact
  • Submit A Journal
  • Submit A Conference
  • Submit Paper/Book
    • Submit a Preprint
    • Submit a Book
  • Contact
  • Journal of Multidisciplinary Modeling and Optimization
  • Volume:1 Issue:2
  • New Hybrid Conjugate Gradient Method as a Convex Combination of Liu-Storey and Dixon Methods

New Hybrid Conjugate Gradient Method as a Convex Combination of Liu-Storey and Dixon Methods

Authors : Khalil ABBO, Nehal HAMEED
Pages : 91-99
View : 5 | Download : 2
Publication Date : 2019-01-21
Article Type : Research Paper
Abstract :In this paper we consider a new hybrid conjugate gradient algorithm, which is convex combination of the Liu-Story algorithm and Dixon algorithm, the descent property and global convergence are proved for the new suggested method. Numerical comparisons show that the present method often behaves better than Liu-Storey and Dixon methods. 
Keywords : Conjugate gradient, Descente property

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.


Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025