A new halfspace-relaxation projection method for the split feasibility problem (Q2472374): Difference between revisions

Let \(C\) and \(Q\) be nonempty closed convex in \(\mathbb R^{n}\) and \(\mathbb R^{m}\), respectively, and \(A\) an \(m\times n\) real matrix. The problem, to find \( x\in C\) with \(Ax\in Q\) if such \(x\) exists, is called the split feasibility problem(SPF). The authors propose a new halfspace-relaxation projection method for the SFP. The method is implemented very easily and is proven to be fully convergent to the solution for the case where the solution set of the SFP is nonempty.