Compressed gradient tracking algorithms for distributed nonconvex optimization

In this paper, we study the distributed nonconvex optimization problem, aiming to minimize the average value of the local nonconvex cost functions using local information exchange. To reduce the communication overhead, we introduce three general classes of compressors, i.e., compressors with bounded...

Celý popis

Podrobná bibliografia

Vydané v:	Automatica (Oxford) Ročník 177; s. 112286
Hlavní autori:	Xu, Lei, Yi, Xinlei, Wen, Guanghui, Shi, Yang, Johansson, Karl H., Yang, Tao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.07.2025
Predmet:	Communication compression Gradient tracking algorithm Linear convergence Nonconvex optimization Polyak–Łojasiewicz condition Sublinear convergence Linear convergence Polyak–Łojasiewicz condition Nonconvex optimization Communication compression Gradient tracking algorithm Sublinear convergence
ISSN:	0005-1098, 1873-2836
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!