.png){kind=icon}
Return
Quantized Distributed Gradient Tracking Algorithm With Linear Convergence in Directed Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3219289.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Communication efficiency is a major bottleneck in the applications of distributed networks. To address the problem, the problem of quantized distributed optimization has attracted a lot of attention. However, most of the existing quantized distributed optimization algorithms can only converge sublinearly. To achieve linear convergence, this article proposes a novel quantized distributed gradient tracking algorithm (Q-DGT) to minimize a finite sum of local objective functions over directed networks. Moreover, we explicitly derive lower bounds for the number of quantization levels, and prove that Q-DGT can converge linearly even when the exchanged variables are respectively quantized with three quantization levels. Numerical results also confirm the efficiency of the proposed algorithm.
Keywords:
Directed networks
distributed optimization
gra-dient tracking algorithm
quantized communication
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveShareSaveEffect of Prophylactic Migraine Medications on the Pharmacokinetic and Pharmacodynamic Profiles of Sumatriptan.png)
Cephalalgia
CephalalgiaIF0
PREAI
ShareSave View more