A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Automatic Control Année : 2016

A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization

Résumé

Based on the idea of randomized coordinate descent of $\alpha$-averaged operators, a randomized primal-dual optimization algorithm is introduced, where a random subset of coordinates is updated at each iteration. The algorithm builds upon a variant of a recent (deterministic) algorithm proposed by Vũ and Condat that includes the well known ADMM as a particular case. The obtained algorithm is used to solve asynchronously a distributed optimization problem. A network of agents, each having a separate cost function containing a differentiable term, seek to find a consensus on the minimum of the aggregate objective. The method yields an algorithm where at each iteration, a random subset of agents wake up, update their local estimates, exchange some data with their neighbors, and go idle. Numerical results demonstrate the attractive performance of the method. The general approach can be naturally adapted to other situations where coordinate descent convex optimization algorithms are used with a random choice of the coordinates.
Fichier principal
Vignette du fichier
1407.0898v3.pdf (224.64 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01237226 , version 1 (02-12-2015)

Identifiants

Citer

Pascal Bianchi, Walid Hachem, Franck Iutzeler. A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization. IEEE Transactions on Automatic Control, 2016, 61 (10), pp.2947-2957. ⟨10.1109/TAC.2015.2512043⟩. ⟨hal-01237226⟩
446 Consultations
233 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More