Abstract

Let C and Q be nonempty closed convex sets in R n and R m , respectively, and A an m by n real matrix. The problem, to find x ∈ C with Ax ∈ Q if such x exist, is called the split feasibility problem (SFP). This problem is important in intensity-modulated radiation therapy, signal processing, image reconstruction and so on. In this paper, based on a new reformulation for the SFP, we 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. Preliminary computational experience is also reported.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.