A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems
نویسندگان
چکیده
منابع مشابه
A Modified Halpern’s Iterative Scheme for Solving Split Feasibility Problems
and Applied Analysis 3 PK is called the metric projection ofH ontoK. It is well known that PK is a nonexpansive mapping ofH onto K and satisfies 〈x − y, PKx − PKy〉 ≥ ∥ PKx − PKy ∥ ∥ 2 , 2.3 for every x, y ∈ H. Moreover, PKx is characterized by the following properties: PKx ∈ K and 〈x − PKx, y − PKx〉 ≤ 0, ∥ ∥x − y∥∥ ≥ ‖x − PKx‖ ∥ ∥y − PKx ∥
متن کاملA Modified Algorithm for Solving the Split Feasibility Problem
In this paper a modified algorithm for solving the split feasibility problem (SFP) is presented. This algorithm uses the generalized Armijo line search in computing predictor step size and gives a correction step rule in the iterative process, which makes an accelerated convergence to the solution of SFP. Meanwhile, it needs not to compute the matrix inverses and the large eigenvalue of the mat...
متن کاملA numerical scheme for solving nonlinear backward parabolic problems
In this paper a nonlinear backward parabolic problem in one dimensional space is considered. Using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. For the corresponding problem, the backward finite differences method with suitable grid size is applied. It is shown that if the coefficients satisfy some special conditions, th...
متن کاملSome Modified Extragradient Methods for Solving Split Feasibility and Fixed Point Problems
and Applied Analysis 3 in medical image reconstruction. A number of image reconstruction problems can be formulated as the SFP; see, for example, 11 and the references therein. Recently, it is found that the SFP can also be applied to study intensity-modulated radiation therapy IMRT 12–14 . In the recent past, a wide variety of iterative methods have been used in signal processing and image rec...
متن کاملModified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
The purpose of this paper is to use the modified block iterative method to propose an algorithm for solving the convex feasibility problems for an infinite family of quasi-φ-asymptotically nonexpansive mappings. Under suitable conditions some strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces with Kadec-Klee property. The results presented in the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2012
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2012/876069