Abstract
In this paper, we introduce two fast projection algorithms for solving the multiple-sets split feasibility problem (MSFP). Our algorithms accelerate algorithms proposed in [8] and are proved to have a global convergence rate O(1=n2). Preliminary numerical experiments show that these algorithms are practical and promising.
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.
