  We show that the averaged consensus algorithm on directed graphs with
unreliable communications by Bof-Carli-Schenato has a dual optimization
interpretation, which could be extended to the case of distributed
optimization. We report on our numerical simulations for the distributed
optimization algorithm for smooth and nonsmooth functions.
