A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions. - Archive ouverte HAL Access content directly
Journal Articles SMAI Journal of Computational Mathematics Year : 2015

A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions.

(1) , (2)
1
2

Abstract

We analyze alternating descent algorithms for minimizing the sum of a quadratic function and block separable non-smooth functions. In case the quadratic interactions between the blocks are pairwise, we show that the schemes can be accelerated, leading to improved convergence rates with respect to related accelerated parallel proximal descent. As an application we obtain very fast algorithms for computing the proximity operator of the 2D and 3D total variation.
Fichier principal
Vignette du fichier
SMAI-JCM_2015__1__29_0.pdf (1.41 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01099182 , version 1 (31-12-2014)
hal-01099182 , version 2 (07-01-2015)
hal-01099182 , version 3 (18-06-2019)

Identifiers

Cite

Antonin Chambolle, Thomas Pock. A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions.. SMAI Journal of Computational Mathematics, 2015, 1, pp.29 - 54. ⟨10.5802/smai-jcm.3⟩. ⟨hal-01099182v3⟩
563 View
550 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More