Finding a best approximation pair of points for two polyhedra
From MaRDI portal
Publication:1616942
DOI10.1007/s10589-018-0021-3zbMath1409.90126arXiv1707.09639MaRDI QIDQ1616942
Ron Aharoni, Yair Censor, Zilin Jiang
Publication date: 7 November 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.09639
convex polyhedra; alternating projections; best approximation pair; half-spaces; Cheney-Goldstein theorem; Halpern-Lions-Wittmann-Bauschke algorithm
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C20: Quadratic programming