Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudaf...Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.展开更多
The purpose of this paper is to study and analyze an iterative method for finding a common element of the solution set ~ of the split feasibility problem and the set F（T） of fixed points of a right Bregman strongly ...The purpose of this paper is to study and analyze an iterative method for finding a common element of the solution set ~ of the split feasibility problem and the set F（T） of fixed points of a right Bregman strongly nonexpansive mapping T in the setting of p- uniformly convex Banach spaces which are also uniformly smooth. By combining Mann＇s iterative method and the Halpern＇s approximation method, we propose an iterative algorithm for finding an element of the set F（T）∩Ω moreover, we derive the strong convergence of the proposed algorithm under appropriate conditions and give numerical results to verify the efficiency and implementation of our method. Our results extend and complement many known related results in the literature.展开更多
基金supported by National Natural Science Foundation of China(61503385)Fundamental Research Funds for the Central Universities of China(3122016L002)
文摘Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.
文摘The purpose of this paper is to study and analyze an iterative method for finding a common element of the solution set ~ of the split feasibility problem and the set F（T） of fixed points of a right Bregman strongly nonexpansive mapping T in the setting of p- uniformly convex Banach spaces which are also uniformly smooth. By combining Mann＇s iterative method and the Halpern＇s approximation method, we propose an iterative algorithm for finding an element of the set F（T）∩Ω moreover, we derive the strong convergence of the proposed algorithm under appropriate conditions and give numerical results to verify the efficiency and implementation of our method. Our results extend and complement many known related results in the literature.
