.png){kind=icon}
返回
An efficient hybrid conjugate gradient method for unconstrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1012930416777.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, we propose a nonlinear conjugate gradient method, which produces a descent search direction at every iteration and converges globally provided that the cline search satisfies the weak Wolfe conditions. In this paper, we will study methods related to the new nonlinear conjugate gradient method. Specifically, if the size of the scalar A with respect to the one in the new method belongs to some interval, then the corresponding methods are proved to be globally, convergent; otherwise, we are able to construct a convex quadratic example showing that the methods need not converge. Numerical experiments are made for two combinations of the new method and the Hestenes-Stiefel conjugate gradient method. The initial results show that, one of the hybrid methods is especially efficient for the given test problems.
Keyword:
unconstrained optimization
conjugate gradient method
line search
descent property
global convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
