|
|
 |
| |
|
|
|
Split Algorithms for New Implicit Feasibility Null-Point Problems |
|
|
|
PP: 2113-2118 |
|
|
|
Author(s) |
|
|
|
Abdellatif Moudafi,
Muhammad Aslam Noor,
|
|
|
|
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 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. |
|
|
|
|
|
|
|
