Accelerated Convergence Algorithm for Distributed Constrained Optimization under Time-Varying General Directed Graphs Academic Article uri icon


  • IEEE This paper studies a class of distributed convex optimization problems by a set of agents in which each agent only has access to its own local convex objective function and the estimate of each agent is restricted to both coupling linear constraint and individual box constraints. Our focus is to devise a distributed primal-dual gradient algorithm for working out the problem over a sequence of time-varying general directed graphs. The communications among agents are assumed to be uniformly strongly connected. A column-stochastic mixing matrix and a fixed step-size are applied in the algorithm which exactly steers all the agents to asymptotically converge to a global optimal solution. Based on the standard strong convexity and the smoothness assumptions of the objective functions, we show that the distributed algorithm is capable of driving the whole network to geometrically converge to an optimal solution of the convex optimization problem only if the step-size does not exceed some upper bound. We also give an explicit analysis for the convergence rate of the proposed optimization algorithm. Simulations on economic dispatch problems and demand response problems in power systems are performed to illustrate the effectiveness of the proposed optimization algorithm.

published proceedings


author list (cited authors)

  • Li, H., Lu, Q., Liao, X., & Huang, T.

citation count

  • 52

complete list of authors

  • Li, Huaqing||Lu, Qingguo||Liao, Xiaofeng||Huang, Tingwen

publication date

  • July 2020