On the linear convergence of circumcentered isometry methods

被引:0
作者
Heinz H. Bauschke
Hui Ouyang
Xianfu Wang
机构
[1] University of British Columbia,Mathematics
来源
Numerical Algorithms | 2021年 / 87卷
关键词
Isometry; Projector; Reflector; Friedrichs angle; Best approximation problem; Linear convergence; Circumcentered isometry method; Circumcentered reflection method; Method of alternating projections; Accelerated symmetric method of alternating projections; Primary 41A50; 47H30; 65B99; Secondary 46B04; 90C25;
D O I
暂无
中图分类号
学科分类号
摘要
The circumcentered Douglas–Rachford method (C–DRM), introduced by Behling, Bello Cruz and Santos, iterates by taking the circumcenter of associated successive reflections. It is an acceleration of the well-known Douglas-Rachford method (DRM) for finding the best approximation onto the intersection of finitely many affine subspaces. Inspired by the C–DRM, we introduced the more flexible circumcentered reflection method (CRM) and circumcentered isometry method (CIM). The CIM essentially chooses the closest point to the solution among all of the points in an associated affine hull as its iterate and is a generalization of the CRM. The circumcentered–reflection method introduced by Behling, Bello Cruz and Santos to generalize the C–DRM is a special class of our CRM. We consider the CIM induced by a set of finitely many isometries for finding the best approximation onto the intersection of fixed point sets of the isometries which turns out to be an intersection of finitely many affine subspaces. We extend our previous linear convergence results on CRMs in finite-dimensional spaces from reflections to isometries. In order to better accelerate the symmetric method of alternating projections (MAP), the accelerated symmetric MAP first applies another operator to the initial point. (Similarly, to accelerate the DRM, the C–DRM first applies another operator to the initial point as well.) Motivated by these facts, we show results on the linear convergence of CIMs in Hilbert spaces with first applying another operator to the initial point. In particular, under some restrictions, our results imply that some CRMs attain the known linear convergence rate of the accelerated symmetric MAP in Hilbert spaces. We also exhibit a class of CRMs converging to the best approximation in Hilbert spaces with a convergence rate no worse than the sharp convergence rate of MAP. The fact that some CRMs attain the linear convergence rate of MAP or accelerated symmetric MAP is entirely new.
引用
收藏
页码:263 / 297
页数:34
相关论文
共 29 条
  • [1] Bauschke HH(2014)The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle J. Approx. Theor. 185 63-79
  • [2] Bello Cruz JY(1997)The method of cyclic projections for closed convex sets in Hilbert space, Recent Developments in Optimization Theory and Nonlinear Analysis (Jerusalem 1995) Contemp. Math. 204 1-38
  • [3] Nghia TTA(2003)Accelerating the convergence of the method of alternating projections Trans. Am. Math. Soc. 355 3433-3461
  • [4] Phan HM(2018)On circumcenters of finite sets in Hilbert spaces Linear Nonlinear Anal. 4 271-295
  • [5] Wang X(2018)Circumcentering the Douglas–Rachford method Numer. Algorithms 78 759-776
  • [6] Bauschke HH(2018)On the linear convergence of the circumcentered-reflection method Oper. Res. Lett. 46 159-162
  • [7] Borwein JM(2020)The block-wise circumcentered-reflection method Comput. Optim. Appl. 76 675-699
  • [8] Lewis AS(1989)Acceleration schemes for the method of alternating projections J. Comput. Appl. Math. 26 235-249
  • [9] Bauschke HH(1967)The method of projections for finding the common point of convex sets USSR Comput. Math. Math. Phys. 7 1-24
  • [10] Deutsch F(undefined)undefined undefined undefined undefined-undefined