The Distributed Dual Ascent Algorithm is Robust to Asynchrony

The distributed dual ascent is an established algorithm to solve strongly convex multi-agent optimization problems with separable cost functions, in the presence of coupling constraints. In this letter, we study its asynchronous counterpart. Specifically, we assume that each agent only relies on the outdated information received from some neighbors. Differently from the existing randomized and dual block-coordinate schemes, we show convergence under heterogeneous delays, communication and update frequencies. Consequently, our asynchronous dual ascent algorithm can be implemented without requiring any coordination between the agents.

[1]  Marc Teboulle,et al.  An $O(1/k)$ Gradient Method for Network Resource Allocation Problems , 2014, IEEE Transactions on Control of Network Systems.

[2]  Asuman E. Ozdaglar,et al.  Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods , 2008, SIAM J. Optim..

[3]  A. Garulli,et al.  A distributed asynchronous method of multipliers for constrained nonconvex optimization , 2018, Autom..

[4]  Ming Yan,et al.  ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates , 2015, SIAM J. Sci. Comput..

[5]  Ion Necoara,et al.  On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems , 2014, Autom..

[6]  Andrea Camisa,et al.  Distributed Constraint-Coupled Optimization over Random Time-Varying Graphs via Primal Decomposition and Block Subgradient Approaches , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[7]  Ye Tian,et al.  Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization , 2018, IEEE Transactions on Automatic Control.

[8]  Gang Feng,et al.  Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints , 2019, IEEE Transactions on Automatic Control.

[9]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[10]  Michael Rabbat,et al.  Decentralized source localization and tracking , 2004 .

[11]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[12]  Wicak Ananduta,et al.  Accelerated Multi-Agent Optimization Method over Stochastic Networks , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

[13]  Angelia Nedic,et al.  Distributed Asynchronous Constrained Stochastic Optimization , 2011, IEEE Journal of Selected Topics in Signal Processing.

[14]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[15]  Robert D. Nowak,et al.  Decentralized source localization and tracking [wireless sensor networks] , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[16]  Henrik Sandberg,et al.  A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems , 2017, IEEE Transactions on Smart Grid.

[17]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[18]  Wotao Yin,et al.  On Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms , 2016, J. Sci. Comput..

[19]  Xiangfeng Wang,et al.  Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and Convergence Analysis , 2015, IEEE Transactions on Signal Processing.

[20]  Ali H. Sayed,et al.  Decentralized Consensus Optimization With Asynchrony and Delays , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[21]  Ruggero Carli,et al.  Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition , 2018, IEEE Transactions on Control of Network Systems.

[22]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[23]  Leon Hirsch,et al.  Fundamentals Of Convex Analysis , 2016 .

[24]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[25]  Maria Prandini,et al.  A Distributed Dual Proximal Minimization Algorithm for Constraint-Coupled Optimization Problems , 2021, IEEE Control Systems Letters.

[26]  Ruggero Carli,et al.  Asynchronous Distributed Optimization Over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence , 2019, IEEE Transactions on Automatic Control.

[27]  Iman Shames,et al.  Asynchronous Distributed Optimization via Dual Decomposition and Block Coordinate Ascent , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).