Finding best approximation pairs for two intersections of closed convex sets
Optimization and Control
2021-10-19 v2
Abstract
The problem of finding a best approximation pair of two sets, which in turn generalizes the well known convex feasibility problem, has a long history that dates back to work by Cheney and Goldstein in 1959. In 2018, Aharoni, Censor, and Jiang revisited this problem and proposed an algorithm that can be used when the two sets are finite intersections of halfspaces. Motivated by their work, we present alternative algorithms that utilize projection and proximity operators. Numerical experiments indicate that these methods are competitive and sometimes superior to the one proposed by Aharoni et al.
Cite
@article{arxiv.2102.13194,
title = {Finding best approximation pairs for two intersections of closed convex sets},
author = {Heinz H. Bauschke and Shambhavi Singh and Xianfu Wang},
journal= {arXiv preprint arXiv:2102.13194},
year = {2021}
}