.png){kind=icon}
Return
Distributed Optimization Over Dependent Random Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3216970.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the averaging-based distributed optimization solvers over random networks. We show a general result on the convergence of such schemes using weight matrices that are row-stochastic almost surely and column-stochastic in expectation for a broad class of dependent weight-matrix sequences. In addition to implying many of the previously known results on this domain, our work shows the robustness of distributed optimization results to link failure. Also, it provides a new tool for synthesizing distributed optimization algorithms. To prove our main theorem, we establish new results on the rate of convergence analysis of averaging dynamics over (dependent) random networks. These secondary results, along with the required martingale-type results to establish them, might be of interest to broader research endeavors in distributed computation over random networks.
Keywords:
Convex optimization
directed graph
distributed optimization
random networks
spanning tree
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveSynthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solution.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
View more