A damped algorithm for the split feasibility and fixed point problems
نویسندگان
چکیده
منابع مشابه
The Hybrid Extragradient Method for the Split Feasibility and Fixed Point Problems
In this paper, we suggest a hybrid extragradient method for finding a common element of the set of fixed point sets of an infinite family of nonexpansive mappings and the solution set of the split feasibility problem (SFP) in real Hilbert spaces.
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملStrong Convergence Algorithm for Split Equilibrium Problems and Hierarchical Fixed Point Problems
The purpose of this paper is to investigate the problem of finding the approximate element of the common set of solutions of a split equilibrium problem and a hierarchical fixed point problem in a real Hilbert space. We establish the strong convergence of the proposed method under some mild conditions. Several special cases are also discussed. Our main result extends and improves some well-know...
متن کامل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...
متن کاملThe Mann-Type Extragradient Iterative Algorithms with Regularization for Solving Variational Inequality Problems, Split Feasibility, and Fixed Point Problems
and Applied Analysis 3 open topic. For example, it is yet not clear whether the dual approach to (7) of [29] can be extended to the SFP. The original algorithm given in [15] involves the computation of the inverse A (assuming the existence of the inverse of A), and thus has not become popular. A seemingly more popular algorithm that solves the SFP is the CQ algorithm of Byrne [16, 21] which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2013
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2013-379