On the regularity of trust region-cg algorithm: With application to deconvolution problem
文献类型：期刊论文
| 作者 | Wang, YF |
| 刊名 | SCIENCE IN CHINA SERIES A-MATHEMATICS
 |
| 出版日期 | 2003-05-01 |
| 卷号 | 46期号:3页码:312-325 |
| 关键词 | ill-posed problems efficient implementation trust region-cg method regularity |
| ISSN号 | 1006-9283 |
| 英文摘要 | Deconvolution problem is a main topic in signal processing. Many practical applications are required to solve deconvolution problems. An important example is image reconstruction. Usually, researchers like to use regularization method to deal with this problem. But the cost of computation is high due to the fact that direct methods are used. This paper develops a trust region-cg method, a kind of iterative methods to solve this kind of problem. The regularity of the method is proved. Based on the special structure of the discrete matrix, FFT can be used for calculation. Hence combining trust region-cg method with FFT is suitable for solving large scale problems in signal processing. |
| 语种 | 英语 |
| WOS记录号 | WOS:000183986300003 |
| 出版者 | SCIENCE CHINA PRESS |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/18112]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Wang, YF |
| 作者单位 | 1.Chinese Acad Sci, Inst Remote Sensing Applicat, Lab Remote Sensing Informat Sci, Beijing 100101, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, State Key Lab Sci & Engn Comp, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wang, YF. On the regularity of trust region-cg algorithm: With application to deconvolution problem[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS,2003,46(3):312-325. |
| APA | Wang, YF.(2003).On the regularity of trust region-cg algorithm: With application to deconvolution problem.SCIENCE IN CHINA SERIES A-MATHEMATICS,46(3),312-325. |
| MLA | Wang, YF."On the regularity of trust region-cg algorithm: With application to deconvolution problem".SCIENCE IN CHINA SERIES A-MATHEMATICS 46.3(2003):312-325. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。