Innovation compression for communication-efficient distributed optimization with linear convergence
Information compression is essential to reduce communication cost in distributed optimization over peer-to-peer networks. This paper proposes a communication-efficient linearly convergent distributed (COLD) algorithm to solve strongly convex optimization problems. By compressing innovation vectors,...
Main Authors: | Zhang, Jiaqi, You, Keyou, Xie, Lihua |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170700 |
Similar Items
-
Convergence of asynchronous distributed gradient methods over stochastic networks
by: Xu, Jinming, et al.
Published: (2020) -
Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs
by: Li, Li, et al.
Published: (2022) -
Convergence acceleration and linear methods
by: I. Tammeraid
Published: (2003-03-01) -
A linearly convergent proximal ADMM with new iterative format for BPDN in compressed sensing problem
by: Bing Xue, et al.
Published: (2022-03-01) -
Sequences of linear operators related to Cesàro-convergent sequences
by: Mira-Cristiana Anisiu, et al.
Published: (2002-08-01)