Graph Simplification-Aided ADMM for Decentralized Composite Optimization

Bin Wang, Jun Fang, Huiping Duan, Hongbin Li

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

In this article, we consider the problem of decentralized composite optimization over a connected and symmetric graph, in which each node holds its own agent-specific private convex functions, and communications are only allowed between nodes with direct links. A variety of algorithms has been proposed to solve such a problem in an alternating direction method of multiplier (ADMM) framework. Many of these algorithms, however, need to include some extra proximal term in the augmented Lagrangian function such that the resulting algorithm can be implemented in a decentralized manner. The use of the extra proximal term slows down the convergence speed because it forces the current solution to stay close to the solution obtained in the previous iteration. To address this issue, in this article, we first introduce the notion of simplest bipartite graph, which is defined as a bipartite graph that has a minimum number of edges to keep the graph connected. A simple two-step message passing-based procedure is proposed to find a simplest bipartite graph associated with the original graph. We show that the simplest bipartite graph has some interesting properties. By utilizing these properties, an ADMM without involving extra proximal terms can be developed to perform decentralized composite optimization over the simplest bipartite graph. The simulation results show that our proposed method achieves a much faster convergence speed than the existing state-of-the-art decentralized algorithms.

Original languageEnglish
Pages (from-to)5170-5183
Number of pages14
JournalIEEE Transactions on Cybernetics
Volume51
Issue number10
DOIs
StatePublished - 1 Oct 2021

Keywords

  • Alternating direction method of multiplier (ADMM)
  • decentralized composite optimization
  • graph simplification
  • simplest bipartite graph

Fingerprint

Dive into the research topics of 'Graph Simplification-Aided ADMM for Decentralized Composite Optimization'. Together they form a unique fingerprint.

Cite this