Abstract
Abstract
In this paper, we are concerned with the split equality common fixed point problem. It is a significant generalization of the split feasibility problem, which can be used in various disciplines, such as medicine, military and biology, etc. We propose an alternating iteration algorithm for solving the split equality common fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings and prove that the sequence generated by the algorithm converges weakly to the solution of this problem. Finally, some numerical results are shown to confirm the feasibility and efficiency of the proposed algorithm.
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference35 articles.
1. Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Alternating proximal algorithms for weakly coupled minimization problems. Applications to dynamical games and PDE’s. J. Convex Anal. 28, 39–44 (2008)
2. Attouch, H., Redont, P., Soubeyran, A.: A new class of alternating proximal minimization algorithms with costs-to-move. SIAM J. Optim. 18, 1061–1081 (2007)
3. Bauschke, H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)
4. Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441–453 (2002)
5. Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103–120 (2004)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献