In this article, we introduce a new viscosity iterative method for two nonexpansive mappings in Hilbert spaces. We also prove, without commutativity assumption, that the iterates converge to a common fixed point of th...In this article, we introduce a new viscosity iterative method for two nonexpansive mappings in Hilbert spaces. We also prove, without commutativity assumption, that the iterates converge to a common fixed point of the mappings which solves some variational inequality. The results presented extend the corresponding results of Shimizu and Takahashi IT. Shimizu, W. Takahashi, Strong convergence to common fixed point of families of nonexpansive mappings, J. Math. Anal. Appl. 211 （1997）, 71-83], and Yao and Chen [Y. Yao, R. Chert, Convergence to common fixed points of average mappings without commutativity assumption in Hilbert spaces, Nonlinear Analysis 67（2007）, 1758-1763].展开更多
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 Thailand Research Fund for financial support under Grant BRG5280016
文摘In this article, we introduce a new viscosity iterative method for two nonexpansive mappings in Hilbert spaces. We also prove, without commutativity assumption, that the iterates converge to a common fixed point of the mappings which solves some variational inequality. The results presented extend the corresponding results of Shimizu and Takahashi IT. Shimizu, W. Takahashi, Strong convergence to common fixed point of families of nonexpansive mappings, J. Math. Anal. Appl. 211 （1997）, 71-83], and Yao and Chen [Y. Yao, R. Chert, Convergence to common fixed points of average mappings without commutativity assumption in Hilbert spaces, Nonlinear Analysis 67（2007）, 1758-1763].
基金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.
