[PDF] Top 20 A damped algorithm for the split feasibility and fixed point problems

... If every closed convex subset of a Hilbert space is the fixed point set of its associating projection, then the split feasibility problem becomes a special case of the split common fixed p[r] ... See full document

... the split feasibility problem and Fix(T) of fixed points of asymptotically quasi-nonexpansive mappings T in the setting of infinite-dimensional Hilbert ...proposed algorithm converges weakly to an ... See full document

... On the other hand, Korpelevich [] introduced an iterative method, the so-called ex- tragradient method, for finding the solution of a saddle point problem. He proved that the sequences generated by the proposed ... See full document

... CQ algorithm and its variant form, refer to ...iterative algorithm to the SFP and proposed an average CQ algorithm which was proven to be weakly conver- gent to a solution of the ...iterative ... See full document

... of fixed point sets of an infinite family of nonexpansive mappings and the solution set of the split feasibility problem (SFP) in real Hilbert ... See full document

... The SCFP is a natural extension of the SFP and of the convex feasibility problem. The SCFP was firstly considered by Censor and Segal in [] where S and T are directed op- erators which include the orthogonal ... See full document

... The iterative algorithm (.) is due to Moudafi [], by generalizing Browder’s and Halpern’s methods, who introduced viscosity approximation methods. Suzuki [] estab- lished a strong convergence theorem by using ... See full document

... The split common fixed point problem for directed ...The split common fixed-point problem for demi-contractive ...for split feasibility problems in Hilbert ...the ... See full document

... the split feasibility problem (SFP) has been rapidly investigated and studied because of its applications in different areas such as signal processing, phase retrievals, image reconstruction, ... See full document

... where C and Q are closed convex subsets in Hilbert spaces H and K, respectively. More- over, if C and Q are the intersections of finitely many closed convex subsets, then the problem is known as the multiple-set ... See full document

... the split feasibility problem (SFP), which was first introduced by Censor and Elfving [], have appeared in various fields of science and technology, such as in signal processing, medical image reconstruction ... See full document

... Very recently, Moudafi (Alternating CQ-algorithms for convex feasibility and split fixed-point problems, J. Nonlinear Convex Anal. ) introduced an alternating CQ-algorithm with weak ... See full document

... fixed point problems, and optimization problems; see [6, 14, 17, 18, 20, ...extragradient algorithm for finding a common element of fixed point set of a nonexpansive mapping and solution ... See full document

... hierarchical fixed points and equilibrium problem,” Bulletin of the Australian Mathematical Society, ...iterative algorithm for nonexpansive mappings ... See full document

... fixed point problems, optimiza- tion problems, complementarity problems, and systems of nonlinear equations as special cases (see [3, 12, 20–22, 29, 38, 40, ...fixed point problem, that ... See full document

... of split feasiblity problem was introduced by Moudafi and Al-Shamas [13], in the case when the mappings are firmly nonexpansive defined on real Hilbert ...Krasnoselskii’s-type algorithm to solve the problem ... See full document

... multiple-sets split feasibility problem, abbreviated as MSFP, is to find a point closest to the intersection of a family of some closed and convex sets in one space, such that its image under a linear ... See full document

... a split equilibrium problem and a fixed point problem of a finite collection of nonexpansive mappings; Onjai-uea and Phuengrattana [19] studied iterative algorithms for solving split mixed equilibrium ... See full document

... of split feasibility problem by focusing on the solution sets of two important problems in the setting of Hilbert ...the algorithm to a common solution of the problem are ...constructed ... See full document

... of split equilibrium problems and the set of common fixed points of a countable family of nonexpansive mappings in Hilbert ...an algorithm to solve an optimization ... See full document