2000 character limit reached
The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems (1310.2195v3)
Published 8 Oct 2013 in math.OC
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.