Two new lower bounds for the spark of a matrix
From MaRDI portal
Publication:4589152
DOI10.1017/S000497271700034XzbMATH Open1373.05024OpenAlexW2623722398MaRDI QIDQ4589152FDOQ4589152
Authors: Hai-Feng Liu, Jihua Zhu, Ji-Gen Peng 
Publication date: 7 November 2017
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s000497271700034x
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
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Title not available (Why is that?)
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Compressed sensing
- A mathematical introduction to compressive sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Uncertainty principles and ideal atomic decomposition
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- Greedy-like algorithms for the cosparse analysis model
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
Cited In (2)
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)
