Journal article

A convergent modified HS-DY hybrid conjugate gradient method for unconstrained optimization problems


Research Areas

Currently no objects available


Publication Details

Author list: Mtagulwa P, Kaelo P

Publisher: Taylor and Francis Online

Publication year: 2019

Volume number: 40

Issue number: 1

Start page: 97

End page: 113

Number of pages: 17

URL: https://www.tandfonline.com/doi/abs/10.1080/02522667.2018.1424087

Languages: English



Conjugate gradient algorithm (method) is a very simple and powerful technique for solving large scale unconstrained optimization problems. In this paper a new modified hybrid conjugate gradient method, based on the work of Liu and Du [17] and Dong, Jiao and Chen [8], is proposed. We show that the proposed algorithm satisfies the descent condition and its global convergence is also established under the weak Wolfe-Powell line search conditions. The proposed algorithm is tested on a number of benchmark problems and the numerical results show that the proposed algorithm is very competitive.


Projects

Currently no objects available


Keywords

Currently no objects available


Documents

Currently no objects available


Last updated on 2022-29-11 at 11:35