Résumé
We establish a general principle which states that regularizing an inverse problem with a convex function yields solutions that are convex combinations of a small number of atoms. These atoms are identified with the extreme points and elements of the extreme rays of the regularizer level sets. An extension to a broader class of quasi-convex regularizers is also discussed. As a side result, we characterize the minimizers of the total gradient variation, which was previously an unresolved problem.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 1260-1281 |
| Nombre de pages | 22 |
| journal | SIAM Journal on Optimization |
| Volume | 29 |
| Numéro de publication | 2 |
| Les DOIs | |
| état | Publié - 1 janv. 2019 |
Empreinte digitale
Examiner les sujets de recherche de « On representer theorems and convex regularization ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver