scientific article; zbMATH DE number 7750674
From MaRDI portal
Publication:6073213
Cites work
- A CDMA multiuser detection algorithm on the basis of belief propagation
- A survey of compressed sensing
- Algorithmic Learning Theory
- Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis
- Atomic decomposition by basis pursuit
- Bayesian signal reconstruction for 1-bit compressed sensing
- Compressed sensing
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Cross validation in sparse linear regression with piecewise continuous nonconvex penalties and its acceleration
- Estimator of prediction error based on approximate message passing for penalized linear regression
- Good error-correcting codes based on very sparse matrices
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- Information, Physics, and Computation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nearly unbiased variable selection under minimax concave penalty
- Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
- Restricted isometry properties and nonconvex compressive sensing
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Approximate Solutions to Linear Systems
- Sparse representations in unions of bases
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The LASSO Risk for Gaussian Matrices
- The restricted isometry property and its implications for compressed sensing
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Vector Approximate Message Passing
Cited in
(14)- A linearly convergent algorithm for sparse signal reconstruction
- Nomonotone spectral gradient method for sparse recovery
- Stable Recovery of Sparse Signals Via Regularized Minimization
- Nonlinear Filtering for Sparse Signal Recovery From Incomplete Measurements
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values
- An Empirical-Bayes Approach to Recovering Linearly Constrained Non-Negative Sparse Signals
- Sparse Signal Approximation via Nonseparable Regularization
- Robust Recovery of Jointly-Sparse Signals Using Minimax Concave Loss Function
- Reconstruction under outliers for Fourier-sparse functions
- Sparse Approximation via Penalty Decomposition Methods
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- On the _1-norm invariant convex k-sparse decomposition of signals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073213)
