Sparse recovery with integrality constraints (Q2192094)

From MaRDI portal

Revision as of 10:22, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Sparse recovery with integrality constraints	scientific article

Statements

scholarly article

0 references

Sparse recovery with integrality constraints (English)

0 references

Jan-Hendrik Lange

0 references

Marc E. Pfetsch

0 references

0 references

Andreas M. Tillmann

0 references

Discrete Applied Mathematics

0 references

publication date

29 June 2020

0 references

full work available at URL

https://arxiv.org/abs/1608.08678

0 references

zbMATH Keywords

sparse recovery

0 references

compressed sensing

0 references

integrality constraints

0 references

nullspace conditions

0 references

describes a project that uses

0 references

0 references

0 references

0 references

Unimodularity Test

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

0 references

DART: A Practical Reconstruction Algorithm for Discrete Tomography

0 references

On the Linear Independence of Fractional Powers of Integers

0 references

0 references

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

0 references

Atomic Decomposition by Basis Pursuit

0 references

Compressed sensing and best 𝑘-term approximation

0 references

Combinatorial Optimization

0 references

A Class of Hard Small 0-1 Programs

0 references

The complexity of recognizing linear systems with certain integrality properties

0 references

Sparse nonnegative solution of underdetermined linear equations by linear programming

0 references

Recovery of Binary Sparse Signals With Biased Measurement Matrices

0 references

PROMP: a sparse recovery approach to lattice-valued signals

0 references

A mathematical introduction to compressive sensing

0 references

0 references

Exact and Approximate Sparse Solutions of Underdetermined Linear Equations

0 references

On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization

0 references

Compressed sensing for finite-valued signals

0 references

Sparse Recovery of Nonnegative Signals With Minimal Expansion

0 references

Combinatorial optimization. Theory and algorithms.

0 references

Column basis reduction and decomposable knapsack problems

0 references

A Novel Convex Relaxation for Non-binary Discrete Tomography

0 references

Probability of unique integer solution to a system of linear equations

0 references

Spatial Compressive Sensing for MIMO Radar

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

0 references

Decomposition of regular matroids

0 references

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

0 references

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

0 references

A decomposition theory for matroids. V: Testing of matrix total unimodularity

0 references

Implementation of a unimodularity test

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.DAM.2020.01.021

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2192094

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2192094&oldid=38933614"