Abstract
In this paper, new projective algorithms using linesearch technique are proposed to solve the split feasibility problem. Weak convergence theorems are established, under suitable conditions, in a real Hilbert space. Some numerical experiments in compressed sensing and image debluring are also provided to show its implementation and efficiency. The main results improve the corresponding results in the literature.
Sign-in/Register to access full text options 
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.
