On circumcenters of finite sets in Hilbert spaces

zbMath1456.51008arXiv1807.02093MaRDI QIDQ5147196

Hui Ouyang, Heinz H. Bauschke, Shawn Xianfu Wang

Publication date: 2 February 2021

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

zbMATH Keywords

Hilbert spacecircumcenterbest approximation problemcircumcentered Douglas-Rachford method

Mathematics Subject Classification ID

Convex programming (90C25) Best approximation, Chebyshev systems (41A50) Euclidean geometries (general) and generalizations (51M05)

Related Items (15)

Circumcentering approximate reflections for solving the convex feasibility problem ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Bregman circumcenters: basic theory ⋮ Circumcentric directions of cones ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ Bregman circumcenters: monotonicity and forward weak convergence ⋮ The block-wise circumcentered-reflection method ⋮ 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 ⋮ Circumcentered methods induced by isometries ⋮ Unnamed Item ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ Best approximation mappings in Hilbert spaces

This page was built for publication: On circumcenters of finite sets in Hilbert spaces