Abstract | ||
---|---|---|
This paper proposes a class of one parameter conjugate gradient methods, which can be regarded as some kinds of convex combinations of some modified form of PRP and HS methods. The scalar βk has the form of ¿ k ¿ k - 1 µ k . The convergence of the given methods is analyzed by some unified tools which show the global convergence of the proposed methods. Numerical experiments with the CUTE collections show that the proposed methods are promising. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1016/j.amc.2015.05.115 | Applied Mathematics and Computation |
Keywords | DocType | Volume |
Unconstrained optimization,Continuous optimization,Conjugate gradient method,Global convergence,Wolfe line search | Journal | 265 |
Issue | ISSN | Citations |
C | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 18 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shengwei Yao | 1 | 65 | 5.53 |
Xiwen Lu | 2 | 182 | 21.03 |
Liangshuo Ning | 3 | 3 | 1.09 |
Feifei Li | 4 | 0 | 0.34 |