Approximation Algorithms for Model-Based Compressive Sensing
From MaRDI portal
Recommendations
- Approximation-tolerant model-based compressive sensing
- Model-Based Compressive Sensing
- Nearly linear-time model-based compressive sensing
- Compressed sensing and best \(k\)-term approximation
- A smooth approximation to probability constrained optimization model in compressed sensing
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Probability constrained optimization model and its D.C. approximation in compressed sensing
- An efficient algorithm for compression-based compressed sensing
- Near-Optimal Adaptive Compressed Sensing
Cited in
(11)- Hierarchical isometry properties of hierarchical measurements
- Discrete optimization methods for group model selection in compressed sensing
- Low rank tensor recovery via iterative hard thresholding
- Iterative hard thresholding for low-rank recovery from rank-one projections
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
- Jointly low-rank and bisparse recovery: questions and partial answers
- Chebyshev unions of planes, and their approximative and geometric properties
- Chebyshev sets composed of subspaces in asymmetric normed spaces
- Strict suns composed of planes
- A randomized algorithm for model-based sparse signal recovery
- Approximative compactness for piecewise approximatively compact sets
This page was built for publication: Approximation Algorithms for Model-Based Compressive Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977311)