本論文研究的是CQ-演算法於分裂可行問題在無窮多維度希爾伯特空間中的收斂性，特點是根據梯度與平均非擴張映射的性質，並將CQ-演算法轉換成固定點演算法，最後證明此演算法會弱收歛至分裂可行性問題的一個解。

In this paper we study the convergence of CQ-Algorithm for split feasibility problem of infinite-dimensional Hilbert spaces.The trait is that the properties of gradient and averaged nonexpansive mapping, and rewritten the CQ-Algorithm as fixed point algorithm. Finally, we prove the Algorithm will converges weakly to a solution of split feasibility problem.

摘要 i
Abstract ii
1 Introduction 1
2 Preliminaries 2
3 Projection Methods for the Split Feasibility Problem 4
3.1 The CQ Algorithm 4
3.2 Fixed point Methods 5
References 10

1. Byrne, C., Iterative oblique projection onto convex sets and the split feasibility problem, Inverse problems. 18 (2002), 441–453
2. Byrne, C., A unified treatment of some iterative algorithms in signal processing and image reconstruction, Inverse problems. 20 (2004), 103–120
3. Censor, Y. and Elfving, T., A multiprojection algorithm using Bregman projections in a product space, Numer. Algorithms. 8 (1994), 221–239.
4. Censor, Y., Elfving, T., Kopf, N., Bortfeld, T., The multiple-sets split feasibility problem and its applications for inverse problems, Inverse problems. 21 (2005), 2071–2084.
5. Xu, H. K., Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces, Inverse problems. 26 (2010), 105018.
6. Xu, H. K., Averaged Mappings and the Gradient-Projection Algorithm, J. Optim. Theory Appl. 150 (2011), 360–378.