The best approximation pair problem relative to two subsets in a normed space
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914026700668928 |
|---|---|
| author | Reem, Daniel Censor, Yair |
| author_facet | Reem, Daniel Censor, Yair |
| contents | 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. We discuss the problem in more general normed spaces and with possibly non-convex subsets, and focus our attention on the issues of uniqueness and existence of the solution to the problem. As far as we know, these fundamental issues have not received much attention. 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. Our results significantly extend the horizon of a recent algorithm for solving the BAP problem [Censor, Mansour, Reem, J. Approx. Theory (2024)]. The paper also shows, perhaps 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_18767 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The best approximation pair problem relative to two subsets in a normed space Reem, Daniel Censor, Yair Optimization and Control Graphics Robotics Functional Analysis Metric Geometry 41A50, 41A52, 41A65, 90C25, 46N10, 90C26, 46B20, 68U05, 65D18 G.1.6; G.1.2; I.3.5 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. We discuss the problem in more general normed spaces and with possibly non-convex subsets, and focus our attention on the issues of uniqueness and existence of the solution to the problem. As far as we know, these fundamental issues have not received much attention. 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. Our results significantly extend the horizon of a recent algorithm for solving the BAP problem [Censor, Mansour, Reem, J. Approx. Theory (2024)]. The paper also shows, perhaps 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. |
| title | The best approximation pair problem relative to two subsets in a normed space |
| topic | Optimization and Control Graphics Robotics Functional Analysis Metric Geometry 41A50, 41A52, 41A65, 90C25, 46N10, 90C26, 46B20, 68U05, 65D18 G.1.6; G.1.2; I.3.5 |
| url | https://arxiv.org/abs/2403.18767 |