A dual ascent algorithm for asynchronous distributed optimization with unreliable directed communications
classification
🧮 math.OC
keywords
optimizationalgorithmdistributedcommunicationsdirecteddualunreliableascent
read the original abstract
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.
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.