On verifiable sufficient conditions for sparse signal recovery via ℓ 1 minimization

Anatoli Juditsky, Arkadi Nemirovski

Type: Article

Publication Date: 2010-10-19

Citations: 107

DOI: https://doi.org/10.1007/s10107-010-0417-z

View Publication

Download PDF

Locations

Mathematical Programming - View
arXiv (Cornell University) - View - PDF
CiteSeer X (The Pennsylvania State University) - View - PDF
HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Verifiable conditions of ℓ 1-recovery for sparse signals with sign restrictions	2010	Anatoli Juditsky Fatma Kılınç Karzan Arkadi Nemirovski
+	A necessary and sufficient condition for sparse vector recovery via ℓ1 − ℓ2 minimization	2021	Ning Bi Wai-Shing Tang
+	General RIP bounds of δ for sparse signals recovery by ℓ minimization	2019	Buxian Chen Anhua Wan
+	Sparse Recovery via ℓ1 Minimization	2020
+	Sparse signal recovery via Kalman-filter-based ℓ1 minimization	2020	D. Hage Miguel Heredia Conde Otmar Loffeld
+	Unified sufficient conditions for uniform recovery of sparse signals via nonconvex minimizations	2017	Hoang Tran Clayton Webster
+	On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures	2013	Anatoli Juditsky Fatma Kılınç Karzan Arkadi Nemirovski
+	Stable recovery of approximately k-sparse signals in noisy cases via ℓ minimization	2020	Anhua Wan
+	1. Sparse Recovery via ℓ<sub>1</sub> Minimization	2020	Anatoli Juditsky Arkadi Nemirovski
+	Algorithm development for sparse signal recovery and performance limits using multiple-user information theory - eScholarship	2011	Yuzhe Jin
+	New Conditions on Stable Recovery of Weighted Sparse Signals via Weighted $$l_1$$ l 1 Minimization	2017	Haiye Huo Wenchang Sun Li Xiao
+	Recovery of signals by a weighted ℓ 2 /ℓ 1 minimization under arbitrary prior support information	2018	Huanmin Ge Wengu Chen
+	A note on guaranteed sparse recovery via <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>ℓ</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>-minimization	2009	Simon Foucart
+ PDF Chat	On Recovery of Sparse Signals Via $\ell _{1}$ Minimization	2009	Tommaso Cai Guangwu Xu Jun Zhang
+	A new approach of conditions on δ 2s (Φ) for s-sparse recovery	2013	Yigang Cen Ruizhen Zhao Zhenjiang Miao Lihui Cen Lihong Cui
+	Recovery of sparsest signals via <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi>ℓ</mml:mi><mml:mi>q</mml:mi></mml:msup></mml:math>-minimization	2011	Qiyu Sun
+	Exact and stable recovery of sequences of signals with sparse increments via differential ℓ [subscript 1]-minimization	2012	Demba E. Ba Behtash Babadi Patrick L. Purdon Emery N. Brown
+	Improved Sparse Recovery Thresholds with Two-Step Reweighted $\ell_1$ Minimization	2010	M. Amin Khajehnejad Weiyu Xu Salman Avestimehr Babak Hassibi
+ PDF Chat	Recovery of signals under the high order RIP condition via prior support information	2018	Wengu Chen Yaling Li WU Guo-qing
+	Chapter 7: Recoverability of Sparse Solutions	2021	Ming‐Jun Lai Yang Wang

Works That Cite This (68)

Action	Title	Year	Authors
+	Faster $p$-Norm Regression Using Sparsity.	2021	Mehrdad Ghadiri Richard Peng Santosh Vempala
+ PDF Chat	On polynomial chaos expansion via gradient-enhanced ℓ1-minimization	2016	Ji Peng Jerrad Hampton Alireza Doostan
+	An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems	2011	Ming‐Jun Lai Jingyue Wang
+ PDF Chat	RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems	2013	Yun-Bin Zhao
+	Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors	2013	Victor Chernozhukov Denis Chetverikov Kengo Kato
+	Various thresholds for $\ell_1$-optimization in compressed sensing	2009	Mihailo Stojnic
+ PDF Chat	Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines	2019	Mustafa Ç. Pınar
+	Optimality of $\ell_2/\ell_1$-optimization block-length dependent thresholds	2013	Mihailo Stojnic
+	A Class of Novel STAP Algorithms Using Sparse Recovery Technique	2009	Hao Zhang Gang Li Huadong Meng
+	RIPless compressed sensing from anisotropic measurements	2013	Richard Kueng David Groß

Works Cited by This (15)

Action	Title	Year	Authors
+	Lectures on Modern Convex Optimization	2001	Aharon Ben‐Tal Arkadi Nemirovski
+ PDF Chat	High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension	2005	David L. Donoho
+	Compressed sensing and best 𝑘-term approximation	2008	Albert Cohen Wolfgang Dahmen Ronald DeVore
+ PDF Chat	Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems	2004	Arkadi Nemirovski
+	Uncertainty principles and ideal atomic decomposition	2001	David L. Donoho Xiaoming Huo
+ PDF Chat	Simultaneous analysis of Lasso and Dantzig selector	2009	Peter J. Bickel Ya’acov Ritov Alexandre B. Tsybakov
+ PDF Chat	Decoding by Linear Programming	2005	Emmanuel J. Candès Terence Tao
+ PDF Chat	Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?	2006	Emmanuel J. Candès Terence Tao
+	Regression Shrinkage and Selection Via the Lasso	1996	Robert Tibshirani
+ PDF Chat	Recovery of Exact Sparse Representations in the Presence of Bounded Noise	2005	J.-J. Fuchs