a dual-based distributed optimization method on time-varying networks

We propose a time-varying dual accelerated gradient method for minimizing the average of n strongly convex and smooth functions over a time-varying network with n nodes. we prove that the time-varying dual accelerated gradient ascent method converges at a linear rate with the time to reach an ε-neighborhood of the solution being of o(ln 1/ϵ). we test the proposed method on two classes of problems: l_2-regularized least squares and logistic classification problems. for each class, we generate 1000 problems and use the dolan-moré performance profiles to compare our obtained results with the ones obtained by several state-of-the-art algorithms to illustrate the efficiency of our method.