A Distributed Methodology for Approximate Uniform Global Minimum Sharing
arXiv:2012.08940 · doi:10.1016/j.automatica.2021.109777
Abstract
The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication network. We propose an adjustable approximate solution which enjoys several properties of crucial importance in applications. In particular, the proposed solution has good decentralization properties and it is scalable in that the number of local variables does not grow with the size or topology of the communication network. Moreover, a global and uniform (both in the initial time and in the initial conditions) asymptotic stability result is provided towards a steady state which can be made arbitrarily close to the sought minimum. Exact asymptotic convergence can be recovered at the price of losing uniformity with respect to the initial time.
References in corpus (10)
- Constrained Consensus
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Harnessing Smoothness to Accelerate Distributed Optimization
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
- ADD-OPT: Accelerated Distributed Directed Optimization
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- Distributed Optimization for Smart Cyber-Physical Networks
- Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
- A System Theoretical Perspective to Gradient-Tracking Algorithms for Distributed Quadratic Optimization