期刊
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
卷 95, 期 10, 页码 2082-2099出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207160.2017.1366457
关键词
Spectral conjugate gradient method; global convergence; conjugacy condition; sufficient descent direction; unconstrained optimization problems
资金
- National Key R&D Program of China [2016YFB0101102]
In this paper, two modified spectral conjugate gradient methods which satisfy sufficient descent property are developed for unconstrained optimization problems. For uniformly convex problems, the first modified spectral type of conjugate gradient algorithm is proposed under the Wolfe line search rule. Moreover, the search direction of the modified spectral conjugate gradient method is sufficiently descent for uniformly convex functions. Furthermore, according to the Dai-Liao's conjugate condition, the second spectral type of conjugate gradient algorithm can generate some sufficient decent direction at each iteration for general functions. Therefore, the second method could be considered as a modification version of the Dai-Liao's algorithm. Under the suitable conditions, the proposed algorithms are globally convergent for uniformly convex functions and general functions. The numerical results show that the approaches presented in this paper are feasible and efficient.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据