z-logo
open-access-imgOpen Access
Is the 1-norm the best convex sparse regularization?
Author(s) -
Yann Traonmilin,
Samuel Vaiter,
Rémi Gribonval
Publication year - 2018
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - regular polygon , norm (philosophy) , mathematics , regularization (linguistics) , proximal gradient methods for learning , computer science , convex optimization , mathematical optimization , convex combination , artificial intelligence , geometry , political science , law

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here