Set intersection problems: supporting hyperplanes and quadratic programming


We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the intersection of closed convex sets, we propose an algorithm that, like Dykstra’s algorithm, converges strongly in a… (More)
DOI: 10.1007/s10107-014-0759-z
View Slides


4 Figures and Tables