Convergence rate of distributed Dykstra's algorithm with sets defined as level sets of convex functions
Optimization and Control
2018-09-26 v1
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.
Keywords
Cite
@article{arxiv.1809.09512,
title = {Convergence rate of distributed Dykstra's algorithm with sets defined as level sets of convex functions},
author = {C. H. Jeffrey Pang},
journal= {arXiv preprint arXiv:1809.09512},
year = {2018}
}
Comments
18 pages, 4 figures