Projection Onto The k-Cosparse Set is NP-Hard - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Projection Onto The k-Cosparse Set is NP-Hard

Résumé

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 Ω. It is shown that this projection problem is (strongly) NP-hard, even in the special cases where the matrix Ω 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
Complexity_of_CoSparse_Projection.pdf (96.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch. Projection Onto The k-Cosparse Set is NP-Hard. 2013. ⟨hal-00802359v1⟩
506 Consultations
330 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More