.png){kind=icon}
.png){kind=icon}
Return
AN ALGORITHM SOLVING COMPRESSIVE SENSING PROBLEM BASED ON MAXIMAL MONOTONE OPERATORS
.png){kind=icon}
PRE
AI
DOI：10.1137/19M1260670.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The need to solve l(1) regularized linear problems can be motivated by various compressive sensing and sparsity related techniques for data analysis and signal or image processing. These problems lead to nonsmooth convex optimization in high dimensions. Theoretical works predict a sharp phase transition for the exact recovery of compressive sensing problems. Our numerical experiments show that state-of-the-art algorithms are not effective enough to observe this phase transition accurately. This paper proposes a simple formalism that enables us to produce an algorithm that computes an l(1) minimizer under the constraints Au = b up to the machine precision. In addition, a numerical comparison with standard algorithms available in the literature is exhibited. The comparison shows that our algorithm compares advantageously with other state-of-the-art methods, both in terms of accuracy and efficiency. With our algorithm, the aforementioned phase transition is observed at high precision.
Keywords:
sparse solution recovery
compressive sensing
inverse scale space
l(1) minimization
nonsmooth optimization
maximal monotone operator
phase transition
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W