.png){kind=icon}
返回
A compact limited memory method for large scale unconstrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.02.045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A compact limited memory method for solving large scale unconstrained optimization problems is proposed. The compact representation of the quasi-Newton updating matrix is derived to the use in the form of limited memory update in which the vector y(k) is replaced by a modified vector y(k) so that more available information about the function can be employed to increase the accuracy of Hessian approximations. The global convergence of the proposed method is proved. Numerical tests on commonly used large scale test problems indicate that the proposed compact limited memory method is competitive and efficient. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
large scale optimization
nonlinear programming
limited memory quasi-Newton method
BFGS update
modified quasi-Newton equation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Gene expression sequences clustering based on the internal and external clustering quality criteria
PREAI
分享收藏
查看更多内容