科研之友
微信
新浪微博
Facebook
分享链接
摘要
The split feasibility problem (SFP) is to find x is an element of C so that Ax is an element of Q, where C is a nonempty closed convex subset of R-n, Q is a nonempty closed convex subset of R-m, and A is a matrix from R-n into R-m. One of successful methods for solving the SFP is Byrne's CQ algorithm. However, to carry out the CQ algorithm, it is required that the closed convex subsets are simple and that the matrix norm is known in advance. Motivated by Tseng's splitting method and Yang's relaxed CQ algorithm, we propose in this paper a new method for solving the SFP, which overcomes the drawback of the CQ algorithm.
- 出版日期2013
- 单位洛阳师范学院
