A survey on compressive sensing: classical results and recent advancements (Q5855706)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A survey on compressive sensing: classical results and recent advancements

scientific article; zbMATH DE number 7326396

Language	Label	Description	Also known as
default for all languages	No label defined
English	A survey on compressive sensing: classical results and recent advancements	scientific article; zbMATH DE number 7326396

Statements

0 references

0 references

0 references

0 references

19 March 2021

0 references

full work available at URL

https://arxiv.org/abs/1908.01014

0 references

zbMATH Keywords

compressive sensing

0 references

$\ell_p$ recovery

0 references

greedy algorithms

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

title

A survey on compressive sensing: classical results and recent advancements (English)

0 references

cites work

Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices

0 references

Greedy sparsity-constrained optimization

0 references

Model-Based Compressive Sensing

0 references

A simple proof of the restricted isometry property for random matrices

0 references

On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms

0 references

Sparsity constrained nonlinear optimization: optimality conditions and algorithms

0 references

Iterative hard thresholding for compressed sensing

0 references

Compressed sensing and its applications. MATHEON workshop, Berlin, Germany, December 2013

0 references

On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations

0 references

Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method

0 references

An adaptive inverse scale space method for compressed sensing

0 references

Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

0 references

Shifting Inequality and Recovery of Sparse Signals

0 references

On Recovery of Sparse Signals Via $\ell _{1}$ Minimization

0 references

Sharp RIP bound for sparse signal and low-rank matrix recovery

0 references

Compressive sampling

0 references

The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).

0 references

Sparsity and incoherence in compressive sampling

0 references

A Probabilistic and RIPless Theory of Compressed Sensing

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

Atomic decomposition by basis pursuit

0 references

Testing the nullspace property using semidefinite programming

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Counting the faces of randomly-projected hypercubes and orthants, with applications

0 references

Sparse nonnegative solution of underdetermined linear equations by linear programming

0 references

Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

0 references

Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization

0 references

A generalized uncertainty principle and sparse representation in pairs of bases

0 references

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

0 references

An EM algorithm for wavelet-based image restoration

0 references

Iterative thresholding algorithms

0 references

Q3078294

0 references

A mathematical introduction to compressive sensing

0 references

A note on guaranteed sparse recovery via $\ell_1$-minimization

0 references

Blind Compressed Sensing

0 references

Exact Recovery Conditions for Sparse Representations With Partial Support Information

0 references

A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm

0 references

Perfect Recovery Conditions for Non-negative Sparse Modeling

0 references

Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)

0 references

Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors

0 references

Compressed sensing for finite-valued signals

0 references

Sparse Recovery of Nonnegative Signals With Minimal Expansion

0 references

Theory and applications of compressed sensing

0 references

Multipath Matching Pursuit

0 references

Sparse recovery with integrality constraints

0 references

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing

0 references

A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit

0 references

New bounds on the restricted isometry constant $\delta _{2k}$

0 references

Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained $\ell_1$ minimization

0 references

Data streams: algorithms and applications.

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

0 references

Sparse signal recovery with exponential-family noise

0 references

Quantization of compressive samples with stable and robust recovery

0 references

On Mehrotra-Type Predictor-Corrector Algorithms

0 references

Robust methods in inverse theory

0 references

GESPAR: Efficient Phase Retrieval of Sparse Signals

0 references

Least sparsity of $p$-norm based optimization problems with $p>1$

0 references

Q4864293

0 references

Computing the spark: mixed-integer programming for the (vector) matroid girth problem

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

Algorithms for simultaneous sparse approximation. I: Greedy pursuit

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

Generalized Orthogonal Matching Pursuit

0 references

Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise

0 references

Subspace Pursuit for Compressive Sensing Signal Reconstruction

0 references

A sharp RIP condition for orthogonal matching pursuit

0 references

A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit

0 references

A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation

0 references

Stable recovery of sparse signals via $\ell_p$-minimization

0 references

Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

0 references

A unified primal-dual algorithm framework based on Bregman iteration

0 references

Necessary and sufficient conditions of solution uniqueness in 1-norm minimization

0 references

Theory of compressive sensing via $\ell_1$-minimization: a non-RIP analysis and extensions

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

Sparse optimization theory and methods

0 references

Equivalence and strong equivalence between the sparsest and least $\ell _1$-norm nonnegative solutions of linear systems and their applications

0 references

RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems

0 references

Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?

0 references

Identifiers

zbMATH Open document ID

1488.94058

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.22124/JMM.2020.16701.1450

0 references

Sitelinks

Mathematics(1 entry)

mardi A survey on compressive sensing: classical results and recent advancements