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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.