The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
classification
🧮 math.OC
keywords
cyclicdouglas-rachfordintersectionalgorithmanalysebehaviourcaseclosed
read the original abstract
We analyse the behaviour of the newly introduced cyclic Douglas-Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty.
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.