Linear convergence of a dual optimization formulation for distributed optimization on directed graphs with unreliable communications
Optimization and Control
2018-11-29 v1
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.
Cite
@article{arxiv.1811.11380,
title = {Linear convergence of a dual optimization formulation for distributed optimization on directed graphs with unreliable communications},
author = {C. H. Jeffrey Pang},
journal= {arXiv preprint arXiv:1811.11380},
year = {2018}
}
Comments
18 pages, 2 figures