本文研究有限多個約束凸優化問題公共解問題。我們將此問題轉換為一個等價的非擴張映射公共固定點問題，然後利用投影方法求解。我們的投影方法主要有三種：循環、平行和逐次投影方法。我們證明這三種方法所生成序列均弱收斂於我們所研究問題的最優解。

In this paper, we study the problem of finding a common minimizer of a finite family of constrained minimization problems. We convert this problem into an equivalent problem of finding a common fixed point of a finite family of nonexpansive mappings. Our methods are basically projection methods. We use three kinds of projection methods which are cyclic, parallel and successive, respectively. We prove that the sequence generated by each of these three projection methods weakly converges to an optimal solution of the problem.

論文審定書 i
摘 要 ii
Abstract iii
Table of Contents iv
1 Introduction.............................................................1
2 The Convex Feasibility Problem................................2
3 Common Minimizer of a Finite of Convex Function......4
Reference..................................................................10

[1] H. H. Bauschke, and J. M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996), 367--426.
[2] P. L. Combttes, Hilbertian convex feasibility problem: convergence of projection methods, Appl. Math. Optim. 35 (1997), 311--330.
[3] K. Goebel, and W. A. Kirk, Topics in Metric Fixed Point Theory, Cambridge University Press (1990).
[4] G. Lopez Acedo, and H. K. Xu, Iterative methods for strict pseudo-contractions in Hilbert spaces, Nonlinear Analysis 67(2007),2258--2271.
[5] H. K. Xu, Averaged mappings and the gradient-projection algorithm, J. Optimiz. Theory Appl. 150 (2011), 360--378.