Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Junfeng Yang, Yin Zhang

TL;DR
This paper introduces alternating direction algorithms for solving various $$-norm minimization problems in compressive sensing, demonstrating their efficiency, stability, and robustness through extensive numerical experiments.
Contribution
It develops primal-dual alternating direction algorithms for $$-problems, providing convergence analysis and practical insights for sparse recovery.
Findings
Algorithms are efficient, stable, and robust.
Performance depends on solution accuracy and measurement errors.
Numerical results favor $$-fidelity in noisy scenarios.
Abstract
In this paper, we propose and study the use of alternating direction algorithms for several -norm minimization problems arising from sparse solution recovery in compressive sensing, including the basis pursuit problem, the basis-pursuit denoising problems of both unconstrained and constrained forms, as well as others. We present and investigate two classes of algorithms derived from either the primal or the dual forms of the -problems. The construction of the algorithms consists of two main steps: (1) to reformulate an -problem into one having partially separable objective functions by adding new variables and constraints; and (2) to apply an exact or inexact alternating direction method to the resulting problem. The derived alternating direction algorithms can be regarded as first-order primal-dual algorithms because both primal and dual variables are updated at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Microwave Imaging and Scattering Analysis · Photoacoustic and Ultrasonic Imaging
