Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.

DOI10.1016/j.jat.2003.08.004zbMath1045.90045MaRDI QIDQ1421503

Simeon Reich, Yair Censor, Lev M. Bregman, Yael Zepkowitz-Malachi

Publication date: 26 January 2004

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2003.08.004

zbMATH Keywords

Dykstra's algorithm; Convex set; Projection; Half-space

Mathematics Subject Classification ID

90C25: Convex programming

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

49J27: Existence theories for problems in abstract spaces