期刊
MATHEMATICS OF COMPUTATION
卷 78, 期 267, 页码 1515-1536出版社
AMER MATHEMATICAL SOC
DOI: 10.1090/S0025-5718-08-02189-3
关键词
-
资金
- DSTA, Singapore
- ONR [N000140710810]
- Department of Defense, USA
- National University of Singapore [R-146-000-113-112]
Finding a solution of a linear equation Au = f with various minimization properties arises from many applications. One such application is compressed sensing, where an efficient and robust-to-noise algorithm to find a minimal l(1) norm solution is needed. This means that the algorithm should be tailored for large scale and completely dense matrices A, while An and A(T)U can be computed by fast transforms and the solution we seek is sparse. Recently, a simple and fast algorithm based on linearized Bregman iteration was proposed in [28, 32] for this purpose. This paper is to analyze the convergence of linearized Bregman iterations and the minimization properties of their limit. Based on our analysis here, we derive also a new algorithm that is proven to be convergent with a rate. Furthermore, the new algorithm is simple and fast in approximating a minimal l(1) norm solution of An = f as shown by numerical simulations. Hence, it can be used as another choice of an efficient tool in compressed sensing.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据