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,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational optimization and applications Ročník 74; číslo 2; s. 387 - 441
Hlavný autor:	Tillmann, Andreas M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!