Accelerated Alternating Descent Methods for Dykstra-like problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Imaging and Vision Année : 2017

Accelerated Alternating Descent Methods for Dykstra-like problems

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
614 Consultations
528 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More