Abstract
This article considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples.
Funding Information
  • National Natural Science Foundation of China (62133003)
  • National Natural Science Foundation of China (61991403)
  • National Natural Science Foundation of China (61991400)
  • Shanghai Municipal Science and Technology Major (2021SHZDZX0100)
  • Knut och Alice Wallenbergs Stiftelse
  • Swedish Foundation for Strategic Research
  • Vetenskapsrådet

This publication has 41 references indexed in Scilit: