Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes |
| |
| Authors: | Ping Liu Xiangguang Dai Qi Han |
| |
| Affiliation: | 1. Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing, College of Electronic and Information Engineering, Southwest University, Chongqing, PR China;2. College of Electrical and Information Engineering, Chongqing University of Science and Technology, Chongqing, PR China |
| |
| Abstract: | This paper is concerned with the distributed optimisation problem over a multi-agent network, where the objective function is described by a sum of all the local objectives of agents. The target of agents is to collectively reach an optimal solution while minimising the global objective function. Under the assumption that the information exchange among agents is depicted by a sequence of time-varying undirected graphs, a distributed optimisation algorithm with uncoordinated time-varying step-sizes is presented, which signifies that the step-sizes of agents are not always uniform per iteration. In light of some reasonable assumptions, this paper fully conducts an explicit analysis for the convergence rate of the optimisation method. A striking feature is that the algorithm has a geometric convergence rate even if the step-sizes are time-varying and uncoordinated. Simulation results on two numerical experiments in power systems show effectiveness and performance of the proposed algorithm. |
| |
| Keywords: | Distributed optimisation uncoordinated time-varying step-sizes linear convergence small gain theorem |
|
|
