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...

Full description

Bibliographic Details

Published in:	Automatica (Oxford) Vol. 177; p. 112286
Main Authors:	Xu, Lei, Yi, Xinlei, Wen, Guanghui, Shi, Yang, Johansson, Karl H., Yang, Tao
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.07.2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!