Convergence rate of distributed Dykstra's algorithm with sets defined as level sets of convex functions
classification
🧮 math.OC
keywords
setsalgorithmconvergenceconvexdefineddistributeddykstrafunctions
read the original 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.
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.