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

Show other versions (1)

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 bette...

Full description

Bibliographic Details
Main Authors: Khalil Abbo, Nehal Hameed
Format: Article
Language:English
Published: Journal of Multidisciplinary Modeling and Optimization 2019-01-01
Series:Journal of Multidisciplinary Modeling and Optimization
Subjects:
Conjugate gradient
Descente property
Online Access:http://dergipark.org.tr/jmmo/issue/42731/477127?publisher=http-w3-sdu-edu-tr-personel-00606-prof-dr-ahmet-sahiner
Description
Summary: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.
ISSN:2645-923X

Similar Items