A distributed ADMM-like method for resource sharing over time-varying networks
From MaRDI portal
Publication:5206938
Abstract: We consider cooperative multi-agent resource sharing problems over time-varying communication networks, where only local communications are allowed. The objective is to minimize the sum of agent-specific composite convex functions subject to a conic constraint that couples agents' decisions. We propose a distributed primal-dual algorithm DPDA-D to solve the saddle point formulation of the sharing problem on time-varying (un)directed communication networks; and we show that primal-dual iterate sequence converges to a point defined by a primal optimal solution and a consensual dual price for the coupling constraint. Furthermore, we provide convergence rates for suboptimality, infeasibility and consensus violation of agents' dual price assessments; examine the effect of underlying network topology on the convergence rates of the proposed decentralized algorithm; and compare DPDA-D with a centralized method on the basis pursuit denoising and multi-channel power allocation problems.
Recommendations
- Distributed resource allocation via multi-agent systems under time-varying networks
- Distributed inexact dual consensus ADMM for network resource allocation
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Distributed resource allocation on dynamic networks in quadratic time
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- A distributed ADMM-like method for resource sharing over time-varying networks
- A first-order augmented Lagrangian method for compressed sensing
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Collaborative Resource Allocation Over a Hybrid Cloud Center and Edge Server Network
- Compressed sensing
- Consensus and Cooperation in Networked Multi-Agent Systems
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Cooperative distributed multi-agent optimization
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed resource allocation on dynamic networks in quadratic time
- Fastest Mixing Markov Chain on a Graph
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- On Distributed Averaging Algorithms and Quantization Effects
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Optimal primal-dual methods for a class of saddle point problems
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- Subgradient methods for saddle-point problems
Cited in
(13)- Distributed convex optimization with coupling constraints over time-varying directed graphs
- A distributed ADMM-like method for resource sharing over time-varying networks
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Distributed resource allocation via multi-agent systems under time-varying networks
- Distributed inexact dual consensus ADMM for network resource allocation
- Decentralized optimization with affine constraints over time-varying networks
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Distributed learning in congested environments with partial information
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- A distributed methodology for approximate uniform global minimum sharing
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
This page was built for publication: A distributed ADMM-like method for resource sharing over time-varying networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206938)
