Journal Article10.9734/JAMCS/2019/45973
A New Projection Type Algorithm for Compressive Sensing
Bohan Zhang,Hongchun Sun +1 more
- 24 Dec 2018
- Vol. 30, Iss: 1, pp 1-11
TL;DR: A new projection-type algorithm (PTA) is proposed to solve CS based on a new formulation of the problem, which needs only one projection onto the nonnegative quadrant and only one value of the mapping per iteration.
read more
Abstract: Compressive sensing (CS) is to recover a sparse signal from an undetermined linear system, which has received considerable interest, and some customized iterative methods for solving CS have been proposed in recent years. In this paper, we further consider an algorithm for solving the CS. To this end, a new projection-type algorithm (PTA) is proposed to solve CS based on a new formulation of the problem, which needs only one projection onto the nonnegative quadrant and only one value of the mapping per iteration. Global convergence results of the new algorithm is established. Furthermore, we illustrate the efficiency of given algorithm through some numerical examples on sparse signal recovery.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Self-adaptive Algorithm for Solving Basis Pursuit Denoising Problem
TL;DR: In this article, a self-adaptive algorithm for solving the basis pursuit denoising problem (BPDP) was proposed, and its global convergence results were established by a sublinearly convergent rate of O( 1/k).
References
•Book
Finite-Dimensional Variational Inequalities and Complementarity Problems
Francisco Facchinei,Jong-Shi Pang +1 more
- 16 Apr 2013
TL;DR: Newton Methods for Nonsmooth Equations as mentioned in this paper and global methods for nonsmooth equations were used to solve the Complementarity problem in the context of non-complementarity problems.
5K
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
TL;DR: In this paper, the authors proposed simple and extremely efficient methods for solving the basis pursuit problem, which is used in compressed sensing, using Bregman iterative regularization, and they gave a very accurate solution after solving only a very small number of instances of the unconstrained problem.
1.6K
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Elaine Hale,Wotao Yin,Yin Zhang +2 more
TL;DR: The structure of optimal solution sets is studied, finite convergence for important quantities is proved, and $q$-linear convergence rates for the fixed-point algorithm applied to problems with $f(x)$ convex, but not necessarily strictly convex are established.
1K
Minimization of $\ell_{1-2}$ for Compressed Sensing
TL;DR: A sparsity oriented simulated annealing procedure with non-Gaussian random perturbation is proposed and the almost sure convergence of the combined algorithm (DCASA) to a global minimum is proved.