摘要:Conjugate gradient methods are the most famousmethods for solving unconstrained, large-scale optimization. Inthis article, we propose a new coefficient of the conjugate gra-dient method for solving unconstrained minimization problems.The new method is a modification of NPRP (2009) coefficient.The sufficient descent condition and global convergence of thenew method are given under the exact line search and thestrong Wolfe line search with σ ∈ (0,18 ). The numerical resultsshow that the new method has good performance in solvingunconstrained minimization problems.
关键词:Conjugate gradient method; unconstrained
minimization problem; sufficient descent condition; global con-
vergence; exact line search; strong Wolfe line search.