  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.
