Skip to main navigation Skip to search Skip to main content

Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design

  • Meng Luan
  • , Guanghui Wen*
  • , Hongzhe Liu
  • , Tingwen Huang
  • , Guanrong Chen
  • , Wenwu Yu
  • *Corresponding author for this work

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

Abstract

The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization problems with closed convex set constraints over directed interaction networks. Under the gradient tracking framework, two distributed algorithms are, respectively, designed over balanced and unbalanced graphs, where momentum terms and two time-scales are involved. Furthermore, it is demonstrated that the designed distributed algorithms attain linear speedup convergence rates provided that the momentum coefficients and the step size are appropriately selected. Finally, numerical simulations verify the effectiveness and the global accelerated effect of the designed algorithms. © 2023 IEEE.
Original languageEnglish
Pages (from-to)2271-2283
Number of pages13
JournalIEEE Transactions on Cybernetics
Volume54
Issue number4
Online published9 May 2023
DOIs
Publication statusPublished - Apr 2024

Funding

This work was supported in part by the National Key Research and Development Program of China under Grant 2022YFA1004702; in part by the National Natural Science Foundation of China under Grant U22B2046, Grant 62073079, Grant 62088101, Grant 62233004, and Grant 62203110; in part by the General Joint Fund of the Equipment Advance Research Program of Ministry of Education under Grant 8091B022114; and in part by the Fundamental Research Funds for the Central Universities under Grant 2242022R20031.

Research Keywords

  • Consensus
  • Convergence
  • Convex functions
  • directed interaction topology
  • distributed constrained optimization
  • Eigenvalues and eigenfunctions
  • gradient tracking
  • linear convergence rate
  • Network topology
  • Numerical simulation
  • Optimization
  • Topology

Fingerprint

Dive into the research topics of 'Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design'. Together they form a unique fingerprint.

Cite this