
Figure 2
Convergence of selected dualspace algorithms on a twodimensional example. (a) Two convex constraint sets with intersection. (b) Two nonconvex constraint sets with several intersections. (c) Two nonconvex constraint sets without intersection (infeasible problem). All iterations start from the same point in the right part of the plots. Symbols represent the actual iterates, the dotted lines are connecting consecutive iterates. ER = errorreduction algorithm (12), CFA = chargeflipping algorithm (13), AAR = averaged alternating reflections (20), RAAR = relaxed averaged alternating reflections (23), DM = difference map [(19), with , ]. 