A general framework for parallelizing Dyskstra splitting
Abstract
We show a general framework of parallelizing Dykstra splitting that includes the classical Dykstra's algorithm and the product space formulation as special cases, and prove their convergence. The key idea is to split up the function whose conjugate takes in the sum of all dual variables in the dual formulation.
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.