Necessary and Sufficient Conditions for Sparsity Pattern Recovery

DOI10.1109/TIT.2009.2032726zbMath1367.94090MaRDI QIDQ4974110

Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal

Publication date: 8 August 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (8)

Iterative algorithm for discrete structure recovery ⋮ Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems ⋮ Variable selection, monotone likelihood ratio and group sparsity ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements ⋮ Which bridge estimator is the best for variable selection? ⋮ The all-or-nothing phenomenon in sparse linear regression ⋮ Sparse regression at scale: branch-and-bound rooted in first-order optimization

This page was built for publication: Necessary and Sufficient Conditions for Sparsity Pattern Recovery