A new efficient hybrid conjugate gradient method based on LS-DY-HS conjugate gradient parameter Online publication date: Wed, 28-Oct-2020
by Nirmalya Kumar Mohanty; Rupaj Kumar Nayak
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 10, No. 4, 2020
Abstract: A nonlinear conjugate gradient method solves unconstrained optimisation problem based on an efficient line search technique and maintains a decent direction search (in case of a minimisation problem) with the help of conjugate gradient parameter. In this paper, a new hybrid conjugate gradient method based on a hybrid conjugate gradient parameter βk is proposed. The proposed βk combines linearly the conjugate gradient parameters of LS, DY and HS method. The present work also discusses the global convergence of the modified algorithm with inexact line search. Moreover, the proposed method is tested on the unconstrained problems from the library CUTEr (Gould et al., 2015) and the results have been compared with the other state of the art algorithms. The results in the numerical experiment show that the proposed hybrid algorithm is efficient.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com