Iterative Approaches to the SplitFeasibility Problem
碩士 === 國立中山大學 === 應用數學系研究所 === 97 === In this paper we discuss iterative algorithms for solving the split feasibility problem (SFP). We study the CQ algorithm from two approaches: one is an optimization approach and the other is a fixed point approach. We prove its convergence first as the gradient-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/f6r9d4 |