One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method

Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Enhancing sparsity by reweighted $\ell _{1}$ minimization
High-Dimensional Probability
Stable recovery of sparse overcomplete representations in the presence of noise
Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Compressed sensing
A mathematical introduction to compressive sensing
Restricted isometry properties and nonconvex compressive sensing
The convex geometry of linear inverse problems
One-bit compressed sensing by linear programming
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Iterative thresholding algorithm based on non-convex method for modified $l_p$-norm regularization minimization
<formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
Minimization of non-smooth, non-convex functionals by iterative thresholding
Shifting Inequality and Recovery of Sparse Signals
On block coherence of frames
Sparse Recovery of Nonnegative Signals With Minimal Expansion
One-bit compressed sensing with non-Gaussian measurements
Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
New bounds on the restricted isometry constant $\delta _{2k}$
Stable recovery of sparse signals via $\ell_p$-minimization
The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
Compressed sensing recovery via nonconvex shrinkage penalties
Dimension reduction by random hyperplane tessellations
On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem
Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
One-bit compressive sensing of dictionary-sparse signals
$ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames
Noisy 1-bit compressive sensing: models and algorithms
One-Bit Compressive Sensing With Norm Estimation
Recovery of signals under the condition on RIC and ROC via prior support information
Unknown Sparsity in Compressed Sensing: Denoising and Inference
Group sparse recovery in impulsive noise via alternating direction method of multipliers

Cited In (3)

One-bit tensor completion via transformed tensor singular value decomposition
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
Theory and fast learned solver for $\ell^1$-TV regularization

Uses Software

Daisy

This page was built for publication: One-bit compressed sensing via ℓ _p(0 < p < 1)-minimization method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000599)