ADD-OPT: Accelerated Distributed Directed Optimization

From MaRDI portal



Abstract: In this paper, we consider distributed optimization problems where the goal is to minimize a sum of objective functions over a multi-agent network. We focus on the case when the inter-agent communication is described by a strongly-connected, emph{directed} graph. The proposed algorithm, ADD-OPT (Accelerated Distributed Directed Optimization), achieves the best known convergence rate for this class of problems,~O(muk),0<mu<1, given strongly-convex, objective functions with globally Lipschitz-continuous gradients, where~k is the number of iterations. Moreover, ADD-OPT supports a wider and more realistic range of step-sizes in contrast to existing work. In particular, we show that ADD-OPT converges for arbitrarily small (positive) step-sizes. Simulations further illustrate our results.




Cited in
(31)








This page was built for publication: ADD-OPT: Accelerated Distributed Directed Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375217)