A Class of Randomized Primal-Dual Algorithms for Distributed Optimization - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2014

A Class of Randomized Primal-Dual Algorithms for Distributed Optimization

Abstract

Based on a preconditioned version of the randomized block-coordinate forward-backward algorithm recently proposed in [23], several variants of block-coordinate primal-dual algo-rithms are designed in order to solve a wide array of monotone inclusion problems. These methods rely on a sweep of blocks of variables which are activated at each iteration according to a random rule, and they allow stochastic errors in the evaluation of the involved operators. Then, this framework is employed to derive block-coordinate primal-dual proximal algorithms for solving composite convex variational problems. The resulting algorithm implementations may be useful for reducing computational complexity and memory requirements. Furthermore, we show that the proposed approach can be used to develop novel asynchronous distributed primal-dual algorithms in a multi-agent context.
Fichier principal
Vignette du fichier
asyncPrimalDual.pdf (380.57 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01077615 , version 1 (26-10-2014)

Identifiers

Cite

Jean-Christophe Pesquet, Audrey Repetti. A Class of Randomized Primal-Dual Algorithms for Distributed Optimization. 2014. ⟨hal-01077615⟩
659 View
145 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More