Abstract
In this paper, we introduce iterative regularization methods for solving the multiple-sets split feasibility problem, that is to find a point closest to a family of closed convex subsets in one space such that its image under a bounded linear mapping will be closest to another family of closed convex subsets in the image space. We consider the cases, when the families are either finite or infinite. We also give two numerical examples for illustrating our main method.
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 callDisclaimer: 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.
