L₁RIP-based robust compressed sensing
From MaRDI portal
Publication:6042575
Cites work
- A matrix-free smoothing algorithm for large-scale support vector machines
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- A wavelet tour of signal processing. The sparse way.
- An adaptive inverse scale space method for compressed sensing
- Analytic loss minimization: theoretical framework of a second order optimization method
- Compressed sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization
- Matching pursuits with time-frequency dictionaries
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse approximate reconstruction decomposed by two optimization problems
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(3)
This page was built for publication: \(\mathrm{L_1RIP}\)-based robust compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042575)