论文部分内容阅读
In the split feasibility problem,one is given a smooth function h(x): Rp→ Rq and two closed convex sets C(C)Rp and Q(C)Rq.One is then asked to find a point x∈Rp simultaneously satisfying x ∈ C and h(x)∈ Q.The multi-set version of the problem represents C = ∩iCi and Q = ∩jQj and intersections of closed convex sets Ci and Qj.A variety of algorithms have been proposed for solving the linear split feasibility problem,namely when h is a linear function.