The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem
Abstract The split feasibility problem (SFP) is finding a point x ∈ C $x\in C$ such that A x ∈ Q $Ax\in Q$ , where C and Q are nonempty closed convex subsets of Hilbert spaces H 1 $H_{1}$ and H 2 $H_{2}$ , and A : H 1 → H 2 $A:H_{1}\rightarrow H_{2}$ is a bounded linear operator. Byrne’s CQ algorith...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2017-09-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13660-017-1480-2 |