1 paper
Roberto Cominetti, Vera Roshchina, Andrew Williamson
The convex feasibility problem consists in finding a point in the intersection of a finite family of closed convex sets. When the intersection is empty, a best compromise is to sea…