Subgradient-Push Is of the Optimal Convergence Rate
From MaRDI portal
Abstract: The push-sum based subgradient is an important method for distributed convex optimization over unbalanced directed graphs, which is known to converge at a rate of . This paper shows that the push-subgradient algorithm actually converges at a rate of , which is the same as that of the single-agent subgradient and thus optimal. The proposed tool for analyzing push-sum based algorithms is of independent interest.
This page was built for publication: Subgradient-Push Is of the Optimal Convergence Rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6395204)
