Key points are not available for this paper at this time.
. We consider the decentralized optimization problem, where a network of \ (n\) agents aims to collaboratively minimize the average of their individual smooth and convex objective functions through peer-to-peer communication in a directed graph. To tackle this problem, we propose two accelerated gradient tracking methods, namely Accelerated Push-DIGing (APD) and APD-SC, for non-strongly convex and strongly convex objective functions, respectively. We show that APD and APD-SC converge at the rates \ (O (1{k²}) \) and \ (O ( ({1 - C{ {L}}) ᵏ}) \), respectively, up to constant factors depending only on the mixing matrix. APD and APD-SC are the first decentralized methods over unbalanced directed graphs that achieve the same provable acceleration as centralized methods. Numerical experiments demonstrate the effectiveness of both methods. Keywordsdecentralized optimizationNesterov's accelerated gradientdirected graphMSC codes90C2590C30
Song et al. (Fri,) studied this question.