Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8902189 | Journal of Computational and Applied Mathematics | 2017 | 28 Pages |
Abstract
Due to its simplicity and low memory requirement, conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems. In this paper, we propose a three-term conjugate gradient method. The search direction is given by a symmetrical Perry matrix, which contains a positive parameter. The value of this parameter is determined by minimizing the distance of this matrix and the self-scaling memoryless BFGS matrix in the Frobenius norm. The sufficient descent property of the generated directions holds independent of line searches. The global convergence of the given method is established under Wolfe line search for general non-convex functions. Numerical experiments show that the proposed method is promising.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Shengwei Yao, Liangshuo Ning,