Inspired by the very recent work by Noor and Noor  and given a closed convex set-valued mapping C, we propose a split algorithm for solving the problem of finding an element x∗ which 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 pure and applied sciences.
Digital Object Identifier (DOI)
Moudafi, Abdellatif and Aslam Noor, Muhammad
"Split Algorithms for New Implicit Feasibility Null-Point Problems,"
Applied Mathematics & Information Sciences: Vol. 08
, Article 4.
Available at: https://dc.naturalspublishing.com/amis/vol08/iss5/4