Linear convergence of a dual optimization formulation for distributed optimization on directed graphs with unreliable communications
classification
🧮 math.OC
keywords
optimizationcommunicationsconvergencedirecteddistributedfunctiongraphslinear
read the original abstract
This work builds on our recent work on a distributed optimization algorithm for graphs with directed unreliable communications. We show its linear convergence when we take either the proximal of each function or an affine minorant for when the function is smooth.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.