论文信息 - The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems - 字舞流文

The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems

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.

Jonathan M. Borwein | Matthew K. Tam | J. Borwein

[1] Heinz H. Bauschke,et al. On the convergence of von Neumann's alternating projection algorithm for two sets , 1993 .

[2] Heinz H. Bauschke,et al. The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle , 2013, J. Approx. Theory.

[3] Heinz H. Bauschke,et al. Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[4] Heinz H. Bauschke,et al. Finding best approximation pairs relative to two closed convex sets in Hilbert spaces , 2004, J. Approx. Theory.

[5] P. L. Combettes,et al. There is no variational characterization of the cycles in the method of periodic projections , 2011, 1102.1378.

[6] Heinz H. Bauschke,et al. The method of cyclic projections for closed convex sets in Hilbert space , 1997 .

[7] Jonathan M. Borwein,et al. A Cyclic Douglas–Rachford Iteration Scheme , 2013, J. Optim. Theory Appl..