Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00802359
Contributor : Rémi Gribonval Connect in order to contact the contributor
Submitted on : Tuesday, March 11, 2014 - 8:50:04 AM
Last modification on : Friday, January 21, 2022 - 3:22:54 AM
Long-term archiving on: : Wednesday, June 11, 2014 - 10:45:45 AM

Files

kCSP_preprint_semifinal.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

486

Files downloads

305