We propose a modified projected Polak–Ribière–Polyak (PRP) conjugate gradient method, where a modified conjugacy condition and a method which generates sufficient descent directions are incorporated into the construction of a suitable conjugacy parameter. It is shown that the proposed method is a modification of the PRP method and generates sufficient descent directions at each iteration. With an Armijo- type line search, the theory of global convergence is established under two weak assumptions. Numerical experiments are employed to test the efficiency of the algorithm in solving some benchmark test problems available in the literature. The numerical results obtained indicate that the algorithm outperforms an existing similar algorithm in requiring fewer function evaluations and fewer iterations to find optimal solutions with the same tolerance. doi:10.1017/S1446181113000084
@article{5910,
title = {A modified projected conjugate gradient algorithm for unconstrained optimization problems},
journal = {ANZIAM Journal},
volume = {53},
year = {2013},
doi = {10.21914/anziamj.v54i0.5910},
language = {EN},
url = {http://dml.mathdoc.fr/item/5910}
}
Huang, Shuai; Deng, Songhai; Wan, Zhong. A modified projected conjugate gradient algorithm for unconstrained optimization problems. ANZIAM Journal, Tome 53 (2013) . doi : 10.21914/anziamj.v54i0.5910. http://gdmltest.u-ga.fr/item/5910/