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

From MaRDI portal
Publication:2980337

DOI10.1109/TAC.2015.2512043zbMATH Open1359.90090arXiv1407.0898OpenAlexW2963607435MaRDI QIDQ2980337FDOQ2980337

Pascal Bianchi, Franck Iutzeler, W. Hachem

Publication date: 3 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: 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~u 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.


Full work available at URL: https://arxiv.org/abs/1407.0898






Cited In (21)


   Recommendations





This page was built for publication: A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980337)