A short note on the Q-linear convergence of the steepest descent method
文献类型：期刊论文
| 作者 | Yuan, Ya-xiang
|
| 刊名 | MATHEMATICAL PROGRAMMING
 |
| 出版日期 | 2010-06-01 |
| 卷号 | 123期号:2页码:339-343 |
| 关键词 | Steepest descent Exact line search Q-linear Rate of convergence |
| ISSN号 | 0025-5610 |
| DOI | 10.1007/s10107-009-0267-8 |
| 英文摘要 | This short note gives the sharp bound for the Q-linear convergence rate of the iterates generated by the steepest descent method with exact line searches when the objective function is strictly convex quadratic. |
| 语种 | 英语 |
| WOS记录号 | WOS:000275161200003 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/10550]  |
| 专题 | 计算数学与科学工程计算研究所 |
| 通讯作者 | Yuan, Ya-xiang |
| 作者单位 | Chinese Acad Sci, State Key Lab Sci Engn Comp, Inst Computat Math & Sci Engn Comp, AMSS, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Yuan, Ya-xiang. A short note on the Q-linear convergence of the steepest descent method[J]. MATHEMATICAL PROGRAMMING,2010,123(2):339-343. |
| APA | Yuan, Ya-xiang.(2010).A short note on the Q-linear convergence of the steepest descent method.MATHEMATICAL PROGRAMMING,123(2),339-343. |
| MLA | Yuan, Ya-xiang."A short note on the Q-linear convergence of the steepest descent method".MATHEMATICAL PROGRAMMING 123.2(2010):339-343. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。