The proposed CPCA algorithm can obtain ε-globally optimal solutions for distributed nonconvex optimization problems with univariate objectives, using gradient-free iterations and efficient communication.
The author presents the Mixing-Accelerated Primal-Dual Proximal Algorithm (MAP-Pro) for decentralized nonconvex optimization, emphasizing convergence rates and communication efficiency.