The best approximation pair problem relative to two subsets in a normed space

Abstract:In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset, which realizes the distance between the subsets. Motivated by our recent algorithm for solving the BAP problem [Censor, Mansour, Reem, J. Approx. Theory (2024)], we discuss the problem in more general normed spaces and with possibly non-convex subsets, and focus our attention on the fundamental issues of uniqueness and existence of the solution to the problem. We present several sufficient geometric conditions for the (at most) uniqueness of a BAP. These conditions are related to the structure and the relative orientation of the boundaries of the subsets and to the norm. We also present many sufficient conditions for the existence of a BAP. In general, the paper re-examines several aspects related to the BAP problem, including the historical one, and shows, probably for the first time, how wide is the scope of the BAP problem in terms of the scientific communities which are involved in it (frequently independently) and in terms of its applications.

Optimization and Control (math.OC); Graphics (cs.GR); Robotics (cs.RO); Functional Analysis (math.FA); Metric Geometry (math.MG)

G.1.6; G.1.2; I.3.5

arXiv:2403.18767 [math.OC]

(or arXiv:2403.18767v4 [math.OC] for this version)

https://doi.org/10.48550/arXiv.2403.18767 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.