A new memory gradient method under exact line search
文献类型：期刊论文
| 作者 | Shi, ZJ |
| 刊名 | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
 |
| 出版日期 | 2003-11-01 |
| 卷号 | 20期号:2页码:275-284 |
| 关键词 | unconstrained optimization memory gradient method exact line search convergence numerical experiment |
| ISSN号 | 0217-5959 |
| 英文摘要 | The paper presents a new memory gradient method for unconstrained optimization problem, and proves the convergence of the algorithm under exact line searches. The linear convergence rate is investigated when the objective function is uniformly convex. Numerical experiments show that the new algorithm is very effective in practice. |
| 语种 | 英语 |
| WOS记录号 | WOS:000187459600009 |
| 出版者 | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/18208]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Shi, ZJ |
| 作者单位 | 1.Qufu Normal Univ, Coll Operat Res & Management, Rizhao 276826, Shandong, Peoples R China 2.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Shi, ZJ. A new memory gradient method under exact line search[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH,2003,20(2):275-284. |
| APA | Shi, ZJ.(2003).A new memory gradient method under exact line search.ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH,20(2),275-284. |
| MLA | Shi, ZJ."A new memory gradient method under exact line search".ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 20.2(2003):275-284. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。