Gateway to Think Tanks
来源类型 | Article |
规范类型 | 其他 |
DOI | 10.1137/0723012 |
Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches. | |
Nazareth J | |
发表日期 | 1986 |
出处 | SIAM Journal on Numerical Analysis 23 (1): 170-177 |
出版年 | 1986 |
语种 | 英语 |
摘要 | Dixon’s theorem (Math. Programming, 2 (1972), PP. 383–387) states that all variable metric methods in the Broyden class develop identical iterates when line searches are exact. Powell’s theorem (Rep. TP 495, AERE, Harwell, England, 1972) is a variant on this, which states that under similar conditions, the Hessian approximation developed by a BFGS update at any step is independent of the updates used at earlier steps. |
URL | http://pure.iiasa.ac.at/id/eprint/13654/ |
来源智库 | International Institute for Applied Systems Analysis (Austria) |
引用统计 | |
资源类型 | 智库出版物 |
条目标识符 | http://119.78.100.153/handle/2XGU8XDN/126951 |
推荐引用方式 GB/T 7714 | Nazareth J. Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches.. 1986. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Nazareth J]的文章 |
百度学术 |
百度学术中相似的文章 |
[Nazareth J]的文章 |
必应学术 |
必应学术中相似的文章 |
[Nazareth J]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。