NP-hardness of $\ell$0 minimization problems: revision and extension to the non-negative setting - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

NP-hardness of $\ell$0 minimization problems: revision and extension to the non-negative setting

Résumé

Sparse approximation arises in many applications and often leads to a constrained or penalized l0 minimization problem, which was proved to be NP-hard. This paper proposes a revision of existing analyses of NP-hardness of the penalized l0 problem and it introduces a new proof adapted from Natarajan's construction (1995). Moreover, we prove that l0 minimization problems with non-negativity constraints are also NP-hard.
Fichier principal
Vignette du fichier
Nguyen19_revised.pdf (240.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02112180 , version 1 (26-04-2019)

Identifiants

Citer

Thi Thanh Nguyen, Charles Soussen, Jérôme Idier, El-Hadi Djermoune. NP-hardness of $\ell$0 minimization problems: revision and extension to the non-negative setting. 13th International Conference on Sampling Theory and Applications, SampTA 2019, Jul 2019, Bordeaux, France. ⟨10.1109/sampta45681.2019.9030937⟩. ⟨hal-02112180⟩
209 Consultations
201 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More