The splitting algorithms by Ryu, by Malitsky-Tam, and by Campoy applied to normal cones of linear subspaces converge strongly to the projection onto the intersection
Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang

TL;DR
This paper demonstrates that splitting algorithms by Ryu, Malitsky-Tam, and Campoy strongly converge to the projection onto the intersection of subspaces, providing explicit convergence results in a specific case involving normal cone operators.
Contribution
It shows strong convergence and explicit projection results for these algorithms when applied to normal cones of subspaces, extending previous weak convergence results.
Findings
Strong convergence to the projection onto the intersection.
Applicable to normal cone operators of subspaces.
Numerical experiments support theoretical results.
Abstract
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that the resolvents of the operators are available, this problem can be tackled with the Douglas-Rachford algorithm. However, when dealing with three or more operators, one must work in a product space with as many factors as there are operators. In groundbreaking recent work by Ryu and by Malitsky and Tam, it was shown that the number of factors can be reduced by one. A similar reduction was achieved recently by Campoy through a clever reformulation originally proposed by Kruger. All three splitting methods guarantee weak convergence to some solution of the underlying sum problem; strong convergence holds in the presence of uniform monotonicity. In this paper, we provide a case study when the operators involved are normal cone operators of subspaces…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Optimization and Variational Analysis · Matrix Theory and Algorithms
