Accelerated Alternating Descent Methods for Dykstra-like problems

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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01346532
Contributor : Antonin Chambolle <>
Submitted on : Tuesday, July 19, 2016 - 11:03:46 AM
Last modification on : Wednesday, March 27, 2019 - 4:08:31 PM

File

AlterDescent2.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

894

Files downloads

485