On circumcenters of finite sets in Hilbert spaces

zbMATH Open1456.51008arXiv1807.02093MaRDI QIDQ5147196FDOQ5147196

Authors: Heinz H. Bauschke, Hui Ouyang, Xianfu Wang 

Publication date: 2 February 2021

Abstract: A well-known object in classical Euclidean geometry is the circumcenter of a triangle, i.e., the point that is equidistant from all vertices. The purpose of this paper is to provide a systematic study of the circumcenter of sets containing finitely many points in Hilbert space. This is motivated by recent works of Behling, Bello Cruz, and Santos on accelerated versions of the Douglas--Rachford method. We present basic results and properties of the circumcenter. Several examples are provided to illustrate the tightness of various assumptions.

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

Recommendations

• Circumcenters in real normed spaces
• scientific article; zbMATH DE number 1332094
• Observations on circumcenters in normed planes
• On restricted centers of sets
• The center of distances of central Cantor sets
• On Hilbertian subsets of finite metric spaces
• On circumscribed cylinders of convex sets
• Chebyshev centres and centrable sets
• scientific article; zbMATH DE number 1670850
• scientific article; zbMATH DE number 1064681

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)

Cited In (19)

• Some theorems for the locus of No.\,\(k\) Center of a higher dimensional cospherical finite point set
• On circumcenter mappings induced by nonexpansive operators
• A finitely convergent circumcenter method for the convex feasibility problem
• Title not available (Why is that?)
• Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
• The block-wise circumcentered-reflection method
• A successive centralized circumcentered-reflection method for the convex feasibility problem
• Best approximation mappings in Hilbert spaces
• The circumcentered-reflection method achieves better rates than alternating projections
• Circumcentered methods induced by isometries
• On the linear convergence of circumcentered isometry methods
• Bregman circumcenters: basic theory
• Finite convergence of locally proper circumcentered methods
• 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: monotonicity and forward weak convergence
• Circumcentric directions of cones
• On the centralization of the circumcentered-reflection method

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

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