Sparse recovery with integrality constraints
From MaRDI portal
Publication:2192094
DOI10.1016/J.DAM.2020.01.021zbMath1457.94043arXiv1608.08678OpenAlexW3005514563MaRDI QIDQ2192094
Marc E. Pfetsch, Jan-Hendrik Lange, Andreas M. Tillmann, Bianca M. Seib
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08678
Integer programming (90C10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (5)
A survey on compressive sensing: classical results and recent advancements ⋮ Compressed sensing for finite-valued signals ⋮ Block-sparse recovery of semidefinite systems and generalized null space conditions ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Recovery under side constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Column basis reduction and decomposable knapsack problems
- The complexity of recognizing linear systems with certain integrality properties
- A hierarchy of polynomial time lattice basis reduction algorithms
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- Decomposition of regular matroids
- PROMP: a sparse recovery approach to lattice-valued signals
- Implementation of a unimodularity test
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Probability of unique integer solution to a system of linear equations
- Compressed sensing for finite-valued signals
- Combinatorial Optimization
- Compressed sensing and best 𝑘-term approximation
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Atomic Decomposition by Basis Pursuit
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- A Class of Hard Small 0-1 Programs
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Spatial Compressive Sensing for MIMO Radar
- Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
- Recovery of Binary Sparse Signals With Biased Measurement Matrices
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- DART: A Practical Reconstruction Algorithm for Discrete Tomography
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- On the Linear Independence of Fractional Powers of Integers
- A Novel Convex Relaxation for Non-binary Discrete Tomography
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Sparse recovery with integrality constraints
