Is the 1-norm the best convex sparse regularization?

Abstract

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) regularization in the context of general low-dimensional recovery and show that indeed the 1-norm is an optimal convex sparse regularization within this framework.

Publication
international Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques (iTWIST’18)