Projection onto the Cosparse Set is NP-Hard - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Projection onto the Cosparse Set is NP-Hard

Abstract

The computational complexity of a problem arising in the context of sparse optimization is considered, namely, the projection onto the set of $k$-cosparse vectors w.r.t. some given matrix $\Omeg$. It is shown that this projection problem is (strongly) \NP-hard, even in the special cases in which the matrix $\Omeg$ contains only ternary or bipolar coefficients. Interestingly, this is in contrast to the projection onto the set of $k$-sparse vectors, which is trivially solved by keeping only the $k$ largest coefficients.
Fichier principal
Vignette du fichier
kCSP_preprint_semifinal.pdf (105.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00802359 , version 1 (21-03-2013)
hal-00802359 , version 2 (11-03-2014)

Identifiers

Cite

Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch. Projection onto the Cosparse Set is NP-Hard. ICASSP14 - International Conference on Acoustics, Speech, and Signal Processing, May 2014, Florence, Italy. ⟨10.1109/ICASSP.2014.6854987⟩. ⟨hal-00802359v2⟩
499 View
325 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More