期刊
SIAM JOURNAL ON NUMERICAL ANALYSIS
卷 51, 期 2, 页码 927-957出版社
SIAM PUBLICATIONS
DOI: 10.1137/110840364
关键词
sparse optimization; sparse vector recovery; compressed sensing; low-rank matrix recovery; matrix completion; iterative reweighted least squares; l(q) minimization
资金
- ARL
- ARO [W911NF-09-1-0383]
- AFOSR [FA9550-10-C-0108]
- NSF [DMS-0748839]
- ONR [N00014-08-1-1101]
- Directorate For Engineering [1028790] Funding Source: National Science Foundation
In this paper, we first study l(q) minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained l(q) minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1-38] for constrained l(q) minimization, we start with a preliminary yet novel analysis for unconstrained l(q) minimization, which includes convergence, error bound, and local convergence behavior. Then, the algorithm and analysis are extended to the recovery of low-rank matrices. The algorithms for both vector and matrix recovery have been compared to some state-of-the-art algorithms and show superior performance on recovering sparse vectors and low-rank matrices.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据