By virtue of the modified conjugate parameter and spectral conjugate gradient al-gorithm,a new hybrid spectral conjugate gradient method is proposed to tackle unconstrained optimization problems.The proposed method always the sufficient descent property during the iteration process.Additionally,the new method has been proven to be globally convergent under the standard Wolfe line search condition.Compared with the existing improved version of the WYL conjugate gradient method through numerical simulation,the results evidence that the proposed method enjoys better computational performance.
unconstrained optimizationhybrid spectral conjugate gradient methodstan-dard Wolfe line searchglobal convergence
NETL
NSTL
万方数据
