摘要
l1-regularized problems have a wide application in various areas such as signal processing. It minimizes a quadratic function combined with an l1 norm term. Iterative soft-thresholding method (IST) is originally proposed to deal with these problems, and fixed point continuation algorithm (FPC) was proposed recently as an improved version of IST. This paper obtains a two-step version of FPC (TwFPC) by combining the new iterate of FPC with its previous two iterates. We also provide an analysis for the convergence of FPC and TwFPC. Various numerical experiments on image deconvolution and compressed sensing show that TwFPC improves IST significantly and is much faster than other competing codes. What is more important, it is very robust to the involved parameters and the regularization parameter.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 575-588 |
| 页数 | 14 |
| 期刊 | Frontiers of Mathematics in China |
| 卷 | 5 |
| 期 | 3 |
| DOI | |
| 出版状态 | 已出版 - 2010 |
指纹
探究 'Two-step version of fixed point continuation method for sparse reconstruction' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver