Original paper
A dual approach for optimal algorithms in distributed optimization over networks
Abstract
We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a 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. Our approach is based on the dual of an...
Paper Details
Title
A dual approach for optimal algorithms in distributed optimization over networks
Published Date
Apr 17, 2020
Volume
36
Issue
1
Pages
171 - 210
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History