Is the 1-norm the best convex sparse regularization? - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Is the 1-norm the best convex sparse regularization?


The 1-norm is a good convex regularization for the recovery of sparse vectors from under-determined linear measurements. No other convex regularization seems to surpass its sparse recovery performance. How can this be explained? To answer this question, we define several notions of " best " (convex) regulariza-tion in the context of general low-dimensional recovery and show that indeed the 1-norm is an optimal convex sparse regularization within this framework.
Fichier principal
Vignette du fichier
optimal_reg_abstract_hal.pdf (100.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01819219 , version 1 (20-06-2018)



Yann Traonmilin, Samuel Vaiter, Rémi Gribonval. Is the 1-norm the best convex sparse regularization?. iTWIST'18 - international Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques, Nov 2018, Marseille, France. pp.1-11. ⟨hal-01819219⟩
308 View
163 Download



Gmail Facebook X LinkedIn More