Constructing Test Instances for Basis Pursuit Denoising
From MaRDI portal
Publication:4578433
DOI10.1109/TSP.2012.2236322zbMATH Open1393.94345arXiv1103.2897OpenAlexW2201608243MaRDI QIDQ4578433FDOQ4578433
Authors: Dirk A. Lorenz 
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: The number of available algorithms for the so-called Basis Pursuit Denoising problem (or the related LASSO-problem) is large and keeps growing. Similarly, the number of experiments to evaluate and compare these algorithms on different instances is growing. In this note, we present a method to produce instances with exact solutions which is based on a simple observation which is related to the so called source condition from sparse regularization.
Full work available at URL: https://arxiv.org/abs/1103.2897
Cited In (13)
- Computing and analyzing recoverable supports for sparse reconstruction
- A cyclic projected gradient method
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Fast L1-L2 minimization via a proximal operator
- Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee
- New strong convergence method for the sum of two maximal monotone operators
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- Solving Basis Pursuit
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- Sparse recovery: the square of \(\ell_1/\ell_2\) norms
- Homogeneous penalizers and constraints in convex image restoration
- Templates for convex cone problems with applications to sparse signal recovery
Uses Software
This page was built for publication: Constructing Test Instances for Basis Pursuit Denoising
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578433)
