Skip to main navigation Skip to search Skip to main content

Distributed Proximal Point Algorithm for Constrained Optimization over Unbalanced Graphs

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

This paper studies the convergence rate for distributed constrained optimization problems over unbalanced time-varying graphs, where the objective function is composed of an aggregate sum of local objective functions which are known to individual agents. In order to deal with the problem, a distributed proximal point algorithm (DPPA) is revisited, which does not necessitate the computation of subgradients, and the convergence is rigorously analyzed under mild assumptions with a class of general stepsizes, i.e., positive, decaying and non-summable. Besides, it is proved that the algorithm converges at the rate of (1/√ k) in the ergodic sense with respect to the weight-averaged state of all agents, where > 0 is the iteration number. Moreover, the efficacy of the proposed algorithm is validated by a numerical example. © 2019 IEEE.
Original languageEnglish
Title of host publication2019 IEEE 15th International Conference on Control and Automation, ICCA 2019
PublisherIEEE Computer Society
Pages824-829
ISBN (Electronic)9781728111643
ISBN (Print)9781728111650
DOIs
Publication statusPublished - Jul 2019
Event15th IEEE International Conference on Control and Automation, ICCA 2019 - Edinburgh, United Kingdom
Duration: 16 Jul 201919 Jul 2019

Publication series

NameIEEE International Conference on Control and Automation, ICCA
ISSN (Print)1948-3449
ISSN (Electronic)1948-3457

Conference

Conference15th IEEE International Conference on Control and Automation, ICCA 2019
PlaceUnited Kingdom
CityEdinburgh
Period16/07/1919/07/19

Fingerprint

Dive into the research topics of 'Distributed Proximal Point Algorithm for Constrained Optimization over Unbalanced Graphs'. Together they form a unique fingerprint.

Cite this