%0 Journal Article
%T A new hybrid conjugate gradient algorithm for unconstrained optimization
%J Bulletin of the Iranian Mathematical Society
%I Springer and the Iranian Mathematical Society (IMS)
%Z 1017-060X
%A Han, X.
%A Zhang, J.
%A Chen, J.
%D 2017
%\ 11/30/2017
%V 43
%N 6
%P 2067-2084
%! A new hybrid conjugate gradient algorithm for unconstrained optimization
%K Unconstrained optimization problem
%K hybrid conjugate gradient algorithm
%K sufficient descent directions
%K global convergence
%R
%X In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, especially for solving highly dimensional problems.
%U http://bims.iranjournals.ir/article_1084_109497f29bf88715b9cadc58859c6be0.pdf