Abstract
AbstractIn this paper, we study the alternating CQ algorithm for solving the split equality problem in Hilbert spaces. It is, however, not easy to implement since its selection of the stepsize requires prior information on the norms of bounded linear operators. To avoid this difficulty, we propose several modified algorithms in which the selection of the stepsize is independent of the norms. In particular, we consider the case whenever the convex sets involved are level sets of given convex functions.
Funder
National Natural Science Foundation of China
Foundation of He’nan Educational Committee
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference29 articles.
1. Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Space. Springer, Berlin (2011)
2. Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441–453 (2002)
3. Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103–120 (2004)
4. Byrne, C., Moudafi, A.: Extensions of the CQ algorithm for the split feasibility and split equality problems. J. Nonlinear Convex Anal. 18, 1485–1496 (2017)
5. Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221–239 (1994)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献