.png){kind=icon}
返回
On the steplength selection in gradient methods for unconstrained optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2017.07.037.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The seminal paper by Barzilai and Borwein (1988) has given rise to an extensive investigation, leading to the development of effective gradient methods. Several steplength rules have been first designed for unconstrained quadratic problems and then extended to general nonlinear optimization problems. These rules share the common idea of attempting to capture, in an inexpensive way, some second-order information. However, the convergence theory of the gradient methods using the previous rules does not explain their effectiveness, and a full understanding of their practical behaviour is still missing. In this work we investigate the relationships between the steplengths of a variety of gradient methods and the spectrum of the Hessian of the objective function, providing insight into the computational effectiveness of the methods, for both quadratic and general unconstrained optimization problems. Our study also identifies basic principles for designing effective gradient methods. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
Gradient methods
Steplength selection
Hessian spectral properties
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
K3PO4-promoted domino reactions: diastereoselective synthesis of trans-2,3-dihydrobenzofurans from salicyl N-tert-butanesulfinyl imines and sulfur ylides.png)
RSC AdvancesOAAI
RSC AdvancesIF0
OAAI分享收藏
查看更多内容