The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case
Abstract
We extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is, for the first time, the ability to consider more than two sets, a task which has been in the mind of researchers for many years without much success in fulfilling it because of a certain theoretical obstacle related to cycles and minimizers of general functionals. The other direction is the ability to handle each set as an intersection of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to these extensions is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fejér monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.
Related
- Hereditary Approximation under Hilbertian Extension
- Approximation and extension theorems for normal affine toric varieties
- GGMNIRA as a Gaussian Graphical Model Extension of the NodeIdentifyR Algorithm for Projected Node Importance
- Extension on the convergence rates of moment-SOS hierarchies via approximation of truncated moment sequences
- Complexity, approximation, and extension of proper {a,b}-edge-weightings
BibTeX
@misc{censor2026best,
title = {{The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case}},
author = {Yair Censor and Daniel Reem},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.11105},
eprint = {2609.11105},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11105},
}
RIS
TY - UNPB
TI - The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case
AU - Yair Censor
AU - Daniel Reem
PY - 2026
DA - 2026/10/08
PB - arXiv
DO - 10.48550/arxiv.2609.11105
UR - https://arxiv.org/abs/2609.11105
AB - We extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is, for the first time, the ability to consider more than two sets, a task which has been in the mind of researchers for many years without much success in fulfilling it because of a certain theoretical obstacle related to cycles and minimizers of general functionals. The other direction is the ability to handle each set as an intersection of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to these extensions is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fejér monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.
ER -