Split Algorithms for New Implicit Feasibility Null-Point Problems

Authors

Abdellatif Moudafi, Université des Antilles et de Guyane, Ceregmia-DSI 97200 Schoelcher, Martinique, France
Muhammad Aslam Noor

Author Country (or Countries)

France

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.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.12785/amis/080504

Recommended Citation

Moudafi, Abdellatif and Aslam Noor, Muhammad (2014) "Split Algorithms for New Implicit Feasibility Null-Point Problems," Applied Mathematics & Information Sciences: Vol. 08: Iss. 5, Article 4.
DOI: http://dx.doi.org/10.12785/amis/080504
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss5/4