view article

Figure 2
Convergence of selected dual-space algorithms on a two-dimensional example. (a) Two convex constraint sets with intersection. (b) Two non-convex constraint sets with several intersections. (c) Two non-convex 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 = error–reduction algorithm (12)[link], CFA = charge-flipping algorithm (13)[link], AAR = averaged alternating reflections (20)[link], RAAR = relaxed averaged alternating reflections (23)[link], DM = difference map [(19)[link], with [\gamma_{\rm M} = \beta^{-1}], [\gamma_{\rm D} = -\beta^{-1}]].

ISSN: 2052-5206
Follow Acta Cryst. B
Sign up for e-alerts
Follow Acta Cryst. on Twitter
Follow us on facebook
Sign up for RSS feeds