论文部分内容阅读
We present a parallel iterative algorithm to find the shortest distance projection of a given point onto the intersection of a finite number of closed convex sets in a real Hilbert space ; the number of sets used at each iteration stept corresponding to t