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

We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed sensing and sparse signal recovery. To that end, we identify polynomially solvable special cases, gather upper and lower bounding procedures,...

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 74; no. 2; pp. 387 - 441
Main Author:	Tillmann, Andreas M.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2019 Springer Nature B.V
Subjects:	Algorithms Computation Convex and Discrete Geometry Integer programming Linear programming Management Science Mathematical programming Mathematics Mathematics and Statistics Matrices (mathematics) Operations Research Operations Research/Decision Theory Optimization Signal reconstruction Solvers Statistics Matroid girth 90C10 94A15 05B35 90C57 Mixed-integer programming 68Q17 90C11 Sparse recovery Spark Branch-and-cut Compressed sensing
ISSN:	0926-6003, 1573-2894
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!