Convergence rate of distributed Dykstra's algorithm with sets defined as level sets of convex functions
Abstract
We investigate the convergence rate of the distributed Dykstra's algorithm when some of the sets are defined as the level sets of convex functions. We carry out numerical experiments to compare with the theoretical results obtained.
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.