HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

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
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

Contributor : Antonin Chambolle Connect in order to contact the contributor
Submitted on : Tuesday, July 19, 2016 - 11:03:46 AM
Last modification on : Wednesday, November 3, 2021 - 6:24:51 AM


Files produced by the author(s)



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⟩



Record views


Files downloads