.png){kind=icon}
.png){kind=icon}
Return
Discrete-Time Algorithms for Distributed Constrained Convex Optimization With Linear Convergence Rates
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2020.3022240.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, the constrained optimization problem with its global objective function being the sum of convex local cost functions and the constraint being a closed convex set is researched. The aim of this study is to solve the researched problem in a distributed manner, that is, using only local computations and local information exchanges. Toward this end, two gradient-tracking-based distributed optimization algorithms are designed for the considered problem over weight-balanced and weight-unbalanced graphs, respectively. Since the classical projection method is unsuitable to handle the closed convex set constraint under the gradient-tracking framework, a new indirect projection method is employed in this article to deal with the involved closed convex set constraint. Furthermore, two time scales are introduced to complete the convergence analyses. In addition, under the condition that all local cost functions are strongly convex and L-smooth, it is proved that the algorithms with well-selected fixed step sizes have linear convergence rates.
Keywords:
Constraint
directed graph
distributed optimization
linear convergence rate
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W