Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
From MaRDI portal
(Redirected from Publication:4573131)
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.
Cited in
(18)- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- Distributed consensus-based estimation and control of large-scale systems under gossip communication protocol
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- Distributed nonconvex constrained optimization over time-varying digraphs
- Convergence of random sleep algorithms for optimal consensus
- Finite-time optimal consensus control for second-order multi-agent systems
- Distributed convex optimisation with event-triggered communication in networked systems
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Network synchronization with convexity
- Adaptive control and signal processing literature survey (No. 27)
- Distributed L2-gain control of large-scale systems under gossip communication protocol
- Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- Event-triggered zero-gradient-sum distributed convex optimisation over networks with time-varying topologies
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- Observer-based distributed control of large-scale systems under gossip communication protocol
- Distributed prediction-correction algorithm for convex optimization with coupled constraints
- Event-triggered zero-gradient-sum distributed consensus optimization over directed networks
This page was built for publication: Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573131)
