Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence

Abstract

In this work we focus on the problem of minimizing the sum of convex cost functions in a distributed fashion over a peer-to-peer network. In particular, we are interested in the case in which communications between nodes are prone to failures and the agents are not synchronized among themselves. We address the problem proposing a modified version of the relaxed ADMM, which corresponds to the Peaceman-Rachford splitting method applied to the dual. By exploiting results from operator theory, we are able to prove the almost sure convergence of the proposed algorithm under general assumptions on the distribution of communication loss and node activation events. By further assuming the cost functions to be strongly convex, we prove the linear convergence of the algorithm in mean to a neighborhood of the optimal solution, and provide an upper bound to the convergence rate. Finally, we present numerical results testing the proposed method in different scenarios.

arXiv commentTo appear in IEEE Transactions on Automatic Control

References in corpus (11)

• Constrained Consensus
• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems
• D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
• ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates
• Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis
• Distributed Random Projection Algorithm for Convex Optimization
• Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
• Asynchronous Distributed ADMM for Large-Scale Optimization- Part II: Linear Convergence Analysis and Numerical Performance
• Convergence Rates of Distributed Nesterov-like Gradient Methods on Random Networks
• Distributed Optimization over Lossy Networks via Relaxed Peaceman-Rachford Splitting: a Robust ADMM Approach

Cited by in corpus (15)

• Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
• ADMM-Tracking Gradient for Distributed Optimization over Asynchronous and Unreliable Networks
• Robust Online Learning over Networks
• Extrapolation-based Prediction-Correction Methods for Time-varying Convex Optimization
• tvopt: A Python Framework for Time-Varying Optimization
• Asynchronous distributed collision avoidance with intention consensus for inland autonomous ships
• A Stochastic Operator Framework for Optimization and Learning with Sub-Weibull Errors
• Setwise Coordinate Descent for Dual Asynchronous Decentralized Optimization
• A Low Complexity Decentralized Neural Net with Centralized Equivalence using Layer-wise Learning
• Distributed Stochastic Optimization With Unbounded Subgradients Over Randomly Time-Varying Networks
• A Distributed Methodology for Approximate Uniform Global Minimum Sharing
• Multi-Agent Optimization and Learning: A Non-Expansive Operators Perspective
• Modular Distributed Nonconvex Learning with Error Feedback
• Asynchronous Distributed Learning with Quantized Finite-Time Coordination
• Distributed Prediction-Correction ADMM for Time-Varying Convex Optimization