A dual approach for optimal algorithms in distributed optimization over networks

We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum ∑i=1mfi(z) of functions over in a network. We provide complexity ...