Distributed computation of fast consensus weights using ADMM
We consider the problem of achieving average consensus among multiple agents, where the inter-agent communication network is depicted by a graph. We consider the discrete-time consensus protocol where each agent updates its value as a weighted average of its own value and those of its neighbours. Given a graph, it is known that there exists a set of 'optimal weights' such that the agents reach average consensus asymptotically with an optimal rate of convergence. However, existing methods require the knowledge of the entire graph to compute these optimal weights. We propose a method for each agent to compute its set of optimal weights locally, i.e., each agent only has to know who are its neighbours. The method is derived by solving a matrix norm minimization problem subject to linear constraints in a distributed manner using the Alternating Direction Method of Multipliers (ADMM). We illustrate our results using numerical examples and compare our method with an existing method called the Metropolis weights, which are also computed locally.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
How is Distributed ADMM Affected by Network Topology?
When solving consensus optimization problems over a graph, there is often an explicit characterization of the convergence rate of Gradient Descent (GD) using the spectrum of the graph Laplacian. The same type of problems…
validLearning-Accelerated ADMM for Distributed Optimal Power Flow
We propose a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent …
Distributed OptimizationAdaptive Consensus ADMM for Distributed Optimization
The alternating direction method of multipliers (ADMM) is commonly used for distributed model fitting problems, but its performance and reliability depend strongly on user-defined penalty parameters. We study distributed…
Distributed OptimizationAsynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis
Aiming at solving large-scale learning problems, this paper studies distributed optimization methods based on the alternating direction method of multipliers (ADMM). By formulating the learning problem as a consensus pro…
Distributed OptimizationA Distributed Algorithm for Measure-valued Optimization with Additive Objective
We propose a distributed nonparametric algorithm for solving measure-valued optimization problems with additive objectives. Such problems arise in several contexts in stochastic learning and control including Langevin sa…