New Bounds for Restricted Isometry Constants
From MaRDI portal
Publication:5281299
DOI10.1109/TIT.2010.2054730zbMath1366.94181arXiv0911.1564MaRDI QIDQ5281299
Lie Wang, T. Tony Cai, Guangwu Xu
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.1564
Related Items
A new result on recovery sparse signals using orthogonal matching pursuit, Penalized and constrained LAD estimation in fixed and high dimension, Sufficient conditions on stable reconstruction of weighted problem, Signal recovery under cumulative coherence, Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization, A unified framework for linear dimensionality reduction in L1, THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES, A Survey of Compressed Sensing, Block sparse recovery via mixed \(l_2/l_1\) minimization, Recovery error analysis of noisy measurement in compressed sensing, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, The bounds of restricted isometry constants for low rank matrices recovery, Improved RIP conditions for compressed sensing with coherent tight frames, The \(L_1\) penalized LAD estimator for high dimensional linear regression, Unnamed Item, Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization, Sparse Legendre expansions via \(\ell_1\)-minimization, 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 weightedl1minimization approach to compressed sensing, Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures, New bounds on the restricted isometry constant \(\delta _{2k}\), Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, New bounds for RIC in compressed sensing, Stability analysis of a class of sparse optimization problems, 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, Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\), Noise folding in completely perturbed compressed sensing, Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling, A Tight Bound of Hard Thresholding, Sharp RIP bound for sparse signal and low-rank matrix recovery, Stable restoration and separation of approximately sparse signals, Sparse signals recovery from noisy measurements by orthogonal matching pursuit, Compressed data separation via dual frames based split-analysis with Weibull matrices, On support sizes of restricted isometry constants, Improved bounds for restricted isometry constants, Unnamed Item, Compressed sensing, On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals, Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction, Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions, A note on block-sparse signal recovery with coherent tight frames, New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization, Asymptotic analysis for extreme eigenvalues of principal minors of random matrices, Binary sparse signal recovery with binary matching pursuit *, Robust sparse recovery via a novel convex model, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, Stochastic Collocation Algorithms Using $l_1$-Minimization for Bayesian Solution of Inverse Problems, Unnamed Item, 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, Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
