Subdifferentiable functions and partial data communication in a distributed deterministic asynchronous Dykstra's algorithm

Abstract

We described a decentralized distributed deterministic asynchronous Dykstra's algorithm that allows for time-varying graphs in an earlier paper. In this paper, we show how to incorporate subdifferentiable functions into the framework using a step similar to the bundle method. We point out that our algorithm also allows for partial data communications. We discuss a standard step for treating the composition of a convex and linear function.

29 pages. New in this submission: Subsection 1.3 describes the contributions of this paper without assuming knowledge from other papers