Abstract
Inspired by the very recent work by Noor and Noor (9) and given a closed convex set-valued mapping C, we propose a split algorithm for solving the problem of finding an element xwhich is a zero of a given maximal monotone operator T such that its image, Ax � , under a linear operator, A, is in a closed convex set C(x � ). Then, we present two strong convergence results and state some examples as applications. The ideas and techniques of this paper may motivate the readers to discover some novel and innovative applications of the implicit split feasibility problems in various branches of pu re and applied sciences.
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.
