A composition projection method for convex feasibility problems

In this article, we propose a composition projection algorithm for solving feasibility problem in Hilbert space. The convergence of the proposed algorithm are established by using gap vector which does not involve the nonempty intersection assumption. Moreover, we provide the sufficient and necessary condition for the convergence of the proposed method.

Article

Download

View PDF