Sharp RIP bound for sparse signal and low-rank matrix recovery

From MaRDI portal
Publication:2252129

DOI10.1016/j.acha.2012.07.010zbMath1310.94021arXiv1302.1236OpenAlexW1967357291MaRDI QIDQ2252129

Anru Zhang, T. Tony Cai

Publication date: 16 July 2014

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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



Related Items

A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty, Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery, Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery, Signal recovery under cumulative coherence, Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization, Stable signal recovery from phaseless measurements, THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES, A survey on compressive sensing: classical results and recent advancements, Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization, Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication, Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck, Compressive sensing of high betweenness centrality nodes in networks, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Compressed sensing for real measurements of quaternion signals, Sparsest representations and approximations of an underdetermined linear system, On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery, Improved RIP conditions for compressed sensing with coherent tight frames, Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals, A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization, Stable Image Reconstruction Using Transformed Total Variation Minimization, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Recovery analysis for block ℓp − ℓ1 minimization with prior support information, Recovery of low-rank matrices based on the rank null space properties, Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support, A hierarchical framework for recovery in compressive sensing, A Generalization of Wirtinger Flow for Exact Interferometric Inversion, Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising, A null-space-based weightedl1minimization approach to compressed sensing, A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery, Recovery of signals under the condition on RIC and ROC via prior support information, New bounds for RIC in compressed sensing, Sparse signal reconstruction based on multiparameter approximation function with smoothed \(\ell_0\) norm, Stability analysis of a class of sparse optimization problems, Stable recovery of sparse signals via \(\ell_p\)-minimization, Discrete uncertainty principles and sparse signal processing, Error Localization of Best $L_{1}$ Polynomial Approximants, Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\), The \( \ell _1 \)-analysis in phase retrieval with redundant dictionary, Nonlinear frames and sparse reconstructions in Banach spaces, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials, A Tight Bound of Hard Thresholding, Convergence of projected Landweber iteration for matrix rank minimization, Stable restoration and separation of approximately sparse signals, Single snapshot DOA estimation by minimizing the fraction function in sparse recovery, Low-rank matrix recovery via regularized nuclear norm minimization, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, A non-convex tensor rank approximation for tensor completion, Regularization parameter selection for the low rank matrix recovery, On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Weak Stability of 1-Minimization Methods in Sparse Data Reconstruction, RIP-based performance guarantee for low-tubal-rank tensor recovery, 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, Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem, Characterization of ℓ1 minimizer in one-bit compressed sensing, Asymptotic analysis for extreme eigenvalues of principal minors of random matrices, Truncated sparse approximation property and truncated \(q\)-norm minimization, Robust sparse recovery via a novel convex model, Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization, ROP: matrix recovery via rank-one projections, Perturbation analysis of low-rank matrix stable recovery, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Robust signal recovery for ℓ 1–2 minimization via prior support information, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local 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, Stable recovery of sparse signals with coherent tight frames via lp-analysis approach, Optimal \(D\)-RIP bounds in compressed sensing, Low rank matrix recovery with adversarial sparse noise*



Cites Work