# A Dual Approach for Optimal Algorithms in Distributed Optimization over Networks

3 Sep 2018César A. UribeSoomin LeeAlexander GasnikovAngelia Nedić

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum $\sum_{i=1}^{m}f_i(z)$ of functions over in a network. We provide complexity bounds for four different cases, namely: each function $f_i$ is strongly convex and smooth, each function is either strongly convex or smooth, and when it is convex but neither strongly convex nor smooth... (read more)

PDF Abstract