arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.13194math.OC
收藏

求闭凸集的两个交的最佳逼近对

Finding best approximation pairs for two intersections of closed convex sets

Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang

摘要:

寻找两个集合的最佳逼近对的问题,这反过来又概括了众所周知的凸可行性问题,有着悠久的历史,可以追溯到切尼和戈尔茨坦在1959年的工作。2018年,Aharoni、Censor和Jiang重新研究了这个问题,并提出了一种算法,当两个集合是半空间的有限交集时可以使用。出于他们的工作,我们提出了替代算法,利用投影和邻近算子。数值实验表明,这些方法是有竞争力的,有时优于Aharoni等人提出的一个。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑