Linear convergence of distributed Dykstra's algorithm for sets under an intersection property
arXiv:1812.03773
Abstract
We show the linear convergence of Dykstra's algorithm for sets intersecting in a manner slightly stronger than the usual constraint qualifications.
Some inaccuracies in the treatment of case 3b is corrected. More elaboration in other parts to make reading of the proof easier