Two new lower bounds for the spark of a matrix
From MaRDI portal
Publication:4589152
Recommendations
- An effective algorithm for the spark of sparse binary measurement matrices
- Remarks on the spark of a matrix and the null space property
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Lower bounds for sparse recovery
- Uniqueness conditions for a class of \(\ell_{0}\)-minimization problems
Cites work
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A mathematical introduction to compressive sensing
- Compressed sensing
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Greed is Good: Algorithmic Results for Sparse Approximation
- Greedy-like algorithms for the cosparse analysis model
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse and redundant representations. From theory to applications in signal and image processing.
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Uncertainty principles and ideal atomic decomposition
Cited in
(5)- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Cardinality minimization, constraints, and regularization: a survey
- Remarks on the spark of a matrix and the null space property
- A note on preserving the spark of a matrix
- An effective algorithm for the spark of sparse binary measurement matrices
This page was built for publication: Two new lower bounds for the spark of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589152)
