Rain

Cyclic Relaxed Douglas-R

Cyclic Relaxed Douglas-Ra
Cyclic Relaxed Douglas-Rachford Splitting for Inconsistent Nonconvex Feasibility

We study the cyclic relaxed Douglas-Rachford algorithm for possibly nonconvex, and inconsistent feasibility problems. This algorithm can be viewed as a convex relaxation between the cyclic Douglas-Rachford algorithm first introduced by Borwein and Tam [2014] and the classical cyclic projections algo…

Similar Posts

Leave a Reply

Your email address will not be published. Required fields are marked *