A unitary distributed subgradient method for multi-agent optimization with different coupling sources
From MaRDI portal
Publication:2174029
DOI10.1016/j.automatica.2020.108834zbMath1442.90146arXiv1809.06008MaRDI QIDQ2174029
Changxin Liu, Huiping Li, Yang Shi
Publication date: 17 April 2020
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.06008
distributed optimization; coupled cost functions; coupled inequality constraints; distributed dual decomposition; non-ergodic convergence rate
90C35: Programming involving graphs or networks
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- An augmented Lagrangian method for distributed optimization
- Dual subgradient method with averaging for optimal resource allocation
- Distributed average consensus with least-mean-square deviation
- Discrete-time dynamic average consensus
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Primal convergence from dual subgradient methods for convex optimization
- Quasi-monotone subgradient methods for nonsmooth convex minimization
- On the Convergence of Decentralized Gradient Descent
- Online Distributed Convex Optimization on Dynamic Networks
- Newton-Raphson Consensus for Distributed Convex Optimization
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- A Bregman Splitting Scheme for Distributed Optimization Over Networks
- Accelerated Distributed MPC of Linear Discrete-Time Systems With Coupled Constraints
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Harnessing Smoothness to Accelerate Distributed Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Collective dynamics of ‘small-world’ networks
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
