Multi-Agent Distributed Optimization via Inexact Consensus ADMM
From MaRDI portal
Abstract: Multi-agent distributed consensus optimization problems arise in many signal processing applications. Recently, the alternating direction method of multipliers (ADMM) has been used for solving this family of problems. ADMM based distributed optimization method is shown to have faster convergence rate compared with classic methods based on consensus subgradient, but can be computationally expensive, especially for problems with complicated structures or large dimensions. In this paper, we propose low-complexity algorithms that can reduce the overall computational cost of consensus ADMM by an order of magnitude for certain large-scale problems. Central to the proposed algorithms is the use of an inexact step for each ADMM update, which enables the agents to perform cheap computation at each iteration. Our convergence analyses show that the proposed methods converge well under some convexity assumptions. Numerical results show that the proposed algorithms offer considerably lower computational complexity than the standard ADMM based distributed optimization methods.
Cited in
(60)- A fast proximal gradient algorithm for decentralized composite optimization over directed networks
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- On the linear convergence of two decentralized algorithms
- A new look at distributed optimal output agreement of multi-agent systems
- Proximal ADMM for nonconvex and nonsmooth optimization
- A survey on some recent developments of alternating direction method of multipliers
- A solution strategy for distributed uncertain economic dispatch problems via scenario theory
- Tracking-ADMM for distributed constraint-coupled optimization
- Linear convergence of primal-dual gradient methods and their performance in distributed optimization
- Distributed online semi-supervised support vector machine
- Augmented Lagrangian optimization under fixed-point arithmetic
- Online supervised learning with distributed features over multiagent system
- A fully distributed ADMM-based dispatch approach for virtual power plant problems
- Communication-efficient algorithms for decentralized and stochastic optimization
- Distributed Model Predictive Control of linear discrete-time systems with local and global constraints
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributed and consensus optimization for non-smooth image reconstruction
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Zeroth-order feedback optimization for cooperative multi-agent systems
- Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- Decentralized Dynamic Optimization Through the Alternating Direction Method of Multipliers
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Distributed stochastic variance reduced gradient methods by sampling extra data with replacement
- Decentralized consensus algorithm with delayed and stochastic gradients
- Distributed Robust Subspace Recovery
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- GADMM: fast and communication efficient framework for distributed machine learning
- A randomized incremental primal-dual method for decentralized consensus optimization
- Distributed Nonconvex Optimization of Multiagent Systems Using Boosting Functions to Escape Local Optima
- Sparse canonical correlation analysis algorithm with alternating direction method of multipliers
- A distributed ADMM-like method for resource sharing over time-varying networks
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization
- A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance
- Supervised model predictive control of large‐scale electricity networks via clustering methods
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- A review of decentralized optimization focused on information flows of decomposition algorithms
- A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints
- Golden ratio proximal gradient ADMM for distributed composite convex optimization
- Distributed convex optimization based on ADMM and belief propagation methods
- Optimal gradient tracking for decentralized optimization
- A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
- A decentralized proximal gradient tracking algorithm for composite optimization on Riemannian manifolds
- Delay-tolerant augmented-consensus-based distributed directed optimization
- An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
- Fast and Robust Low-Rank Learning over Networks: A Decentralized Matrix Quantile Regression Approach
- Performing linear convergence for distributed constrained optimisation over time-varying directed unbalanced networks
- Robust and efficient sparse learning over networks: a decentralized surrogate composite quantile regression approach
- Distributed aggregative optimization with affine coupling constraints
- Distributed time-varying optimization over a strongly connected and weight-balanced digraph
- Decentralized bilevel optimization
- A distributed fixed-time optimal consensus control strategy for networked marine surface vehicles under set constraints
- Efficient Distributed Learning over Decentralized Networks with Convoluted Support Vector Machine
This page was built for publication: Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579700)
