Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication

Abstract

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

28 pages, journal; revised

References in corpus (3)

• Sensor Networks with Random Links: Topology Design for Distributed Consensus
• Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
• Distributed Multi-Agent Optimization with State-Dependent Communication

Cited by in corpus (24)

• D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
• Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents
• Online Distributed Optimization on Dynamic Networks
• $QD$-Learning: A Collaborative Distributed Strategy for Multi-Agent Reinforcement Learning Through Consensus + Innovations
• Distributed Optimization for Smart Cyber-Physical Networks
• Distributed Compressed Sensing For Static and Time-Varying Networks
• In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
• Convergence Rates of Distributed Nesterov-like Gradient Methods on Random Networks
• On the O(1/k) Convergence of Asynchronous Distributed Alternating Direction Method of Multipliers
• A Distributed Asynchronous Method of Multipliers for Constrained Nonconvex Optimization
• Coordinate Dual Averaging for Decentralized Online Optimization with Nonseparable Global Objectives
• Decentralized Multi-Agent Reinforcement Learning with Networked Agents: Recent Advances
• STRONG: Synchronous and asynchronous RObust Network localization, under Non-Gaussian noise
• Distributed Resource Allocation for Epidemic control
• Communication Optimality Trade-offs For Distributed Estimation
• Distributed Optimization: Convergence Conditions from a Dynamical System Perspective
• Communication-Efficient Algorithms For Distributed Optimization
• Asynchronous adaptive networks
• Network Flows that Solve Linear Equations
• Distributed Continuous-time Approximate Projection Protocols for Shortest Distance Optimization Problems
• Distributed Sparse Regression via Penalization
• Network Synchronization with Convexity
• Randomized Optimal Consensus of Multi-agent Systems
• Newton-Raphson Consensus for Distributed Convex Optimization