On the linear convergence of circumcentered isometry methods

DOI10.1007/S11075-020-00966-XMaRDI QIDQ2021771zbMATH OpenOpenAlexFDO

Authors Heinz H. Bauschke, Hui Ouyang, Xianfu Wang

Publication date 27 April 2021

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.01063

zbMATH Keywords

accelerated symmetric method of alternating projectionsbest approximation problemcircumcentered isometry methodcircumcentered reflection methodFriedrichs angleisometrylinear convergencemethod of alternating projectionsprojectorreflector

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Isometric theory of Banach spaces (46B04) Operator theory (47-XX) Particular nonlinear operators (superposition, Hammerstein, Nemytski?, Uryson, etc.) (47H30) Acceleration of convergence in numerical analysis (65B99) Convex programming (90C25)

Cites work

• Accelerating the convergence of the method of alternating projections
• Acceleration schemes for the method of alternating projections
• Best approximation in inner product spaces
• Circumcentering the Douglas-Rachford method
• Convex analysis and monotone operator theory in Hilbert spaces
• scientific article; zbMATH DE number 45410 (Why is no real title available?)
• scientific article; zbMATH DE number 1009689 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 3441150 (Why is no real title available?)
• On circumcenters of finite sets in Hilbert spaces
• On the circumcentered-reflection method for the convex feasibility problem
• On the linear convergence of the circumcentered-reflection method
• The block-wise circumcentered-reflection method
• The method of projections for finding the common point of convex sets
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Cited in

(14)

• Circumcentering the Douglas-Rachford method
• The circumcentered-reflection method achieves better rates than alternating projections
• Best approximation mappings in Hilbert spaces
• Circumcentering approximate reflections for solving the convex feasibility problem
• Circumcentering reflection methods for nonconvex feasibility problems
• On the linear convergence of the circumcentered-reflection method
• Bregman circumcenters: basic theory
• Bregman circumcenters: monotonicity and forward weak convergence
• Finite convergence of locally proper circumcentered methods
• Circumcentric directions of cones
• On the centralization of the circumcentered-reflection method
• A successive centralized circumcentered-reflection method for the convex feasibility problem
• On the linear convergence of circumcentered isometry methods
• A finitely convergent circumcenter method for the convex feasibility problem

This page was built for publication: On the linear convergence of circumcentered isometry methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021771)