On Representer Theorems and Convex Regularization - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Optimization Year : 2019

On Representer Theorems and Convex Regularization

(1, 2) , (3) , (4, 5, 6) , (5, 7) , (8) , (9, 8)
1
2
3
4
5
6
7
8
9

Abstract

We establish a general principle which states that regularizing an inverse problem with a convex function yields solutions which 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 still an unresolved problem.
Fichier principal
Vignette du fichier
BCDDGW_18.pdf (344.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01823135 , version 1 (25-06-2018)
hal-01823135 , version 2 (16-07-2018)
hal-01823135 , version 3 (26-11-2018)

Identifiers

Cite

Claire Boyer, Antonin Chambolle, Yohann de Castro, Vincent Duval, Frédéric de Gournay, et al.. On Representer Theorems and Convex Regularization. SIAM Journal on Optimization, 2019, 29 (2), pp.1260-1281. ⟨10.1137/18M1200750⟩. ⟨hal-01823135v3⟩
904 View
730 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More