Shifting Inequality and Recovery of Sparse Signals

DOI10.1109/TSP.2009.2034936zbMath1392.94117OpenAlexW2119323121MaRDI QIDQ4570769

Publication date: 9 July 2018

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

Full work available at URL: https://doi.org/10.1109/tsp.2009.2034936

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

A smoothing iterative method for quantile regression with nonconvex $\ell_p$ penalty, Stable recovery of low-rank matrix via nonconvex Schatten $p$-minimization, The benefit of group sparsity in group inference with de-biased scaled group Lasso, THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES, A survey on compressive sensing: classical results and recent advancements, A Survey of Compressed Sensing, Block sparse recovery via mixed $l_2/l_1$ minimization, Recovery of high-dimensional sparse signals via $\ell_1$-minimization, The bounds of restricted isometry constants for low rank matrices recovery, Nearly optimal minimax estimator for high-dimensional sparse linear regression, The $L_1$ penalized LAD estimator for high dimensional linear regression, The linearized alternating direction method of multipliers for sparse group LAD model, Restricted isometries for partial random circulant matrices, Recovery of sparsest signals via $\ell^q $-minimization, Phase transition in limiting distributions of coherence of high-dimensional random matrices, Unnamed Item, Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation, Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information, A null-space-based weightedl₁minimization approach to compressed sensing, Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices, On the conditions used to prove oracle results for the Lasso, New bounds on the restricted isometry constant $\delta _{2k}$, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression, Recovery of signals under the condition on RIC and ROC via prior support information, New bounds for RIC in compressed sensing, Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions, Concentration of $S$-largest mutilated vectors with $\ell_p$-quasinorm for $0<p\leq 1$ and its applications, Analysis of orthogonal multi-matching pursuit under restricted isometry property, Compressed sensing with coherent tight frames via $l_q$-minimization for $0 < q \leq 1$, On the null space property of $l_q$-minimization for $0 < q \leq 1$ in compressed sensing, Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling, Sparse recovery in probability via $l_q$-minimization with Weibull random matrices for $0 < q\leq 1$, Consistent parameter estimation for Lasso and approximate message passing, Sharp RIP bound for sparse signal and low-rank matrix recovery, Stable restoration and separation of approximately sparse signals, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem, On support sizes of restricted isometry constants, Improved bounds for restricted isometry constants, A note on guaranteed sparse recovery via $\ell_1$-minimization, Compressed sensing, Necessary and sufficient conditions for linear convergence of ℓ1-regularization, A general theory of concave regularization for high-dimensional sparse estimation problems, A note on block-sparse signal recovery with coherent tight frames, Asymptotic analysis for extreme eigenvalues of principal minors of random matrices, The $\ell_{2,q}$ regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Robust sparse recovery via a novel convex model, Sparse recovery with general frame via general-dual-based analysis Dantzig selector, One-bit compressed sensing via ℓ _p(0 < p < 1)-minimization method, Stable recovery of low rank matrices from nuclear norm minimization, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels, Optimal $D$-RIP bounds in compressed sensing