科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we present two Douglas-Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our methods to the classical (product-space) Douglas-Rachford scheme, are promising.
- 出版日期2014-1
