In this note, we propose and study the notion of modified Fejér sequences. Within a Hilbert space setting, this property has been used to prove ergodic convergence of proximal incremental subgradient methods. Here we show that indeed it provides a unifying framework to prove convergence rates for objective function values of several optimization algorithms. In particular, our results apply to forward–backward splitting algorithm, incremental subgradient proximal algorithm, and the Douglas–Rachford splitting method including and generalizing known results
Modified Fejér sequences and applications
Lorenzo Rosasco;Silvia Villa;
2017-01-01
Abstract
In this note, we propose and study the notion of modified Fejér sequences. Within a Hilbert space setting, this property has been used to prove ergodic convergence of proximal incremental subgradient methods. Here we show that indeed it provides a unifying framework to prove convergence rates for objective function values of several optimization algorithms. In particular, our results apply to forward–backward splitting algorithm, incremental subgradient proximal algorithm, and the Douglas–Rachford splitting method including and generalizing known resultsFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
10589_2017_9962_ReferencePDF.pdf
accesso aperto
Tipologia:
Documento in Post-print
Dimensione
308.97 kB
Formato
Adobe PDF
|
308.97 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.