Accelerated Alternating Descent Methods for Dykstra-like problems - Archive ouverte HAL Access content directly
Journal Articles Journal of Mathematical Imaging and Vision Year : 2017

Accelerated Alternating Descent Methods for Dykstra-like problems

(1) , (1) , (2)
1
2

Abstract

This paper extends recent results by the first author and T. Pock (ICG, TU Graz, Austria) on the acceleration of alternating minimization techniques for quadratic plus nonsmooth objectives depending on two variables. We discuss here the strongly convex situation, and how ‘fast’ methods can be derived by adapting the overrelaxation strategy of Nesterov for projected gradient descent. We also investigate slightly more general alternating descent methods, where several descent steps in each variable are alternatively performed.
Fichier principal
Vignette du fichier
AlterDescent2.pdf (1.6 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01346532 , version 1 (19-07-2016)

Identifiers

Cite

Antonin Chambolle, Pauline Tan, Samuel Vaiter. Accelerated Alternating Descent Methods for Dykstra-like problems. Journal of Mathematical Imaging and Vision, 2017, 59 (3), pp.481-497. ⟨10.1007/s10851-017-0724-6⟩. ⟨hal-01346532⟩
579 View
491 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More