Constructing Test Instances for Basis Pursuit Denoising

DOI10.1109/TSP.2012.2236322zbMath1393.94345arXiv1103.2897OpenAlexW2201608243MaRDI QIDQ4578433

Dirk A. Lorenz

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.2897

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Computing and analyzing recoverable supports for sparse reconstruction ⋮ Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems ⋮ Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee ⋮ Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ A cyclic projected gradient method ⋮ Fast L1-L2 minimization via a proximal operator ⋮ Homogeneous penalizers and constraints in convex image restoration ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ Necessary and sufficient conditions of solution uniqueness in 1-norm minimization ⋮ New strong convergence method for the sum of two maximal monotone operators ⋮ Solving Basis Pursuit

Uses Software

• L1TestPack

This page was built for publication: Constructing Test Instances for Basis Pursuit Denoising