Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
From MaRDI portal
Publication:2912172
DOI10.1007/978-1-4614-0772-0_5zbMath1250.65057OpenAlexW119997944MaRDI QIDQ2912172
Publication date: 14 September 2012
Published in: Springer Proceedings in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0772-0_5
inverse problemreconstructioncompressive sensingiterative thresholdingrecovery algorithmsparse vectorslinear measurements
Related Items
Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization, Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling, Equiangular tight frames with simplices and with full spark in \(\mathbb{R}^d\), On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, Improved bounds for the RIP of Subsampled Circulant matrices, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, \(\mathrm{L_1RIP}\)-based robust compressed sensing, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization, Restricted isometries for partial random circulant matrices, Unnamed Item, Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery, Fast overcomplete dictionary construction with probabilistic guarantees, Polynomial approximation via compressed sensing of high-dimensional functions on lower sets, Greedy-like algorithms for the cosparse analysis model, On the sparsity of Lasso minimizers in sparse data recovery, The restricted isometry property for random block diagonal matrices, Stable recovery of sparse signals via \(\ell_p\)-minimization, Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, Sparse signal recovery using a new class of random matrices, A Tight Bound of Hard Thresholding, Fast thresholding algorithms with feedbacks for sparse signal recovery, Unnamed Item, Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization, Dictionary-sparse recovery via thresholding-based algorithms, Fast and RIP-optimal transforms, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, Sparse reconstruction with multiple Walsh matrices, Near oracle performance and block analysis of signal space greedy methods, Greedy signal space methods for incoherence and beyond, Stable recovery of sparse signals with coherent tight frames via lp-analysis approach, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
Uses Software
