.png){kind=icon}
Return
DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2672698.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper develops a fast distributed algorithm, termed DEXTRA, to solve the optimization problem when n agents reach agreement and collaboratively minimize the sum of their local objective functions over the network, where the communication between the agents is described by a directed graph. Existing algorithms solve the problem restricted to directed graphs with convergence rates of O(ln k/root k) for general convex objective functions and O(ln k/k) when the objective functions are strongly convex, where k is the number of iterations. We show that, with the appropriate step-size, DEXTRA converges at a linear rate O(tau(k)) for 0 < tau < 1, given that the objective functions are restricted strongly convex. The implementation of DEXTRA requires each agent to know its local out-egree. Simulation examples further illustrate our findings.
Keywords:
Directed graphs
distributed optimization
multiagent networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection.png)
BMJOAAI
BMJIF0
OAAIShareSaveShareSaveDistributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
PREAI
ShareSaveImpaired B Cell Development and Proliferation in Absence of Phosphoinositide 3-Kinase p85αScience
ScienceIF0
PREAI
ShareSave
ShareSaveShareSave
View more