Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators

References

• Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numer Alg. 1994;8:221–239. doi: 10.1007/BF02142692
   Google Scholar
• Censor Y, Elfving T, Kopf N, Bortfeld T. The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 2005;21:2071–2084. doi: 10.1088/0266-5611/21/6/017
   Web of Science ®Google Scholar
• Wang J, Hu Y, Li C, Yao J-C. Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 2017;33:055017 (25pp).
   Web of Science ®Google Scholar
• Combettes PL, Wajs VR. Signal recovery by proximal forward-backward splitting. Multiscale Model Simul. 2005;4:1168–1200. doi: 10.1137/050626090
   Web of Science ®Google Scholar
• Censor Y, Gibali A, Reich S. Algorithms for the split variational inequality problem. Numer Alg. 2012;59:301–323. doi: 10.1007/s11075-011-9490-5
   Web of Science ®Google Scholar
• Byrne C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 2002;18:441–453. doi: 10.1088/0266-5611/18/2/310
   Web of Science ®Google Scholar
• Landweber L. An iterative formula for Fredholm integral equations of the first kind. Am J Math. 1951;73:615–24. doi: 10.2307/2372313
   Web of Science ®Google Scholar
• Johansson B, Elfving T, Kozlov V, Censor Y, Forssén P-E, Granlund G. The application of an oblique-projected Landweber method to a model of supervised learning. Math Comput Model. 2006;43:892–909. doi: 10.1016/j.mcm.2005.12.010
   Google Scholar
• Piana M, Bertero M. Projected Landweber method and preconditioning. Inverse Probl. 1997;13:441–463. doi: 10.1088/0266-5611/13/2/016
   Web of Science ®Google Scholar
• Zhang H, Cheng LZ. Projected Landweber iteration for matrix completion. J Comput Appl Math. 2010;235:593–601. doi: 10.1016/j.cam.2010.06.010
   Web of Science ®Google Scholar
• Cegielski A. Iterative methods for fixed point problems in hilbert spaces. Lecture Notes in Mathematics, 2057. Heidelberg: Springer; 2012.
   Google Scholar
• Polyak BT. Introduction to optimization. New York: Optimization Software; 1987.
   Google Scholar
• Xu H-K. A variable Krasnosel'skiĭ-Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 2006;22:2021–2034. doi: 10.1088/0266-5611/22/6/007
   Web of Science ®Google Scholar
• Masad E, Reich S. A note on the multiple-set split convex feasibility problem in Hilbert space. J Nonlinear Convex Anal. 2007;8:367–371.
   Web of Science ®Google Scholar
• Krasnosel'skiĭ MA. Two remarks on the method of successive approximations. Uspekhi Mat Nauk. 1955;10:123–127.
   Google Scholar
• Mann WR. Mean value methods in iteration. Proc Am Math Soc. 1953;4:506–510. doi: 10.1090/S0002-9939-1953-0054846-3
   Web of Science ®Google Scholar
• Byrne C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2004;20:103–120. doi: 10.1088/0266-5611/20/1/006
   Web of Science ®Google Scholar
• Xu H-K. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 2010;26:105018 (17pp). doi: 10.1088/0266-5611/26/10/105018
   Web of Science ®Google Scholar
• Xu H-K. Averaged mappings and the gradient-projection algorithm. J Optim Theory Appl. 2011;50:360–378. doi: 10.1007/s10957-011-9837-z
   Google Scholar
• Yang Q. The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 2004;20:1261–1266. doi: 10.1088/0266-5611/20/4/014
   Web of Science ®Google Scholar
• Censor Y, Motova A, Segal A. Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. J Math Anal Appl. 2001;327:1244–1256. doi: 10.1016/j.jmaa.2006.05.010
   Google Scholar
• Censor Y, Segal A. The split common fixed point problem for directed operators. J Convex Anal. 2009;16:587–600.
   Web of Science ®Google Scholar
• Cegielski A. General method for solving the split common fixed point problem. J Optim Theory Appl. 2015;165:385–404. doi: 10.1007/s10957-014-0662-z
   Web of Science ®Google Scholar
• Moudafi A. A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 2011;74:4083–4087. doi: 10.1016/j.na.2011.03.041
   Web of Science ®Google Scholar
• Wang F, Xu H-K. Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 2011;74:4105–4111. doi: 10.1016/j.na.2011.03.044
   Web of Science ®Google Scholar
• Qu B, Xiu N. A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 2005;21:1655–1665. doi: 10.1088/0266-5611/21/5/009
   Web of Science ®Google Scholar
• Yang Q. On variable-step relaxed projection algorithm for variational inequalities. J Math Anal Appl. 2005;302:166–179. doi: 10.1016/j.jmaa.2004.07.048
   Web of Science ®Google Scholar
• López G, Martín-Márquez V, Wang F, Xu H-K. Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 2012;28:085004 (18pp). doi: 10.1088/0266-5611/28/8/085004
   Web of Science ®Google Scholar
• Cegielski A. Landweber-type operator and its properties. Contemp Math. 2016;658:139–148. doi: 10.1090/conm/658/13139
   Google Scholar
• Cegielski A, Al-Musallam F. Strong convergence of a hybrid steepest descent method for the split common fixed point problem. Optimization. 2016;65:1463–1476. doi: 10.1080/02331934.2016.1147038
   Web of Science ®Google Scholar
• Cegielski A, Reich S, Zalas R. Regular sequences of quasi-nonexpansive operators and their applications. SIAM J Optim. 2018;28:1508–1532. doi: 10.1137/17M1134986
   Web of Science ®Google Scholar
• Bauschke HH, Borwein J. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38:367–426. doi: 10.1137/S0036144593251710
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Math Oper Res. 2001;26:248–264. doi: 10.1287/moor.26.2.248.10558
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in hilbert spaces. 2nd ed. Cham: Springer; 2017.
   Google Scholar
• Bargetz C, Kolobov VI, Reich S, Zalas R. Linear convergence rates for extrapolated fixed point algorithms. Optimization. 2019;68:163–195. doi: 10.1080/02331934.2018.1512109
   Web of Science ®Google Scholar
• Bauschke HH, Noll D, Phan HM. Linear and strong convergence of algorithms involving averaged nonexpansive operators. J Math Anal Appl. 2015;421:1–20. doi: 10.1016/j.jmaa.2014.06.075
   Web of Science ®Google Scholar
• Opial Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull Amer Math Soc. 1967;73:591–597. doi: 10.1090/S0002-9904-1967-11761-0
   Web of Science ®Google Scholar
• Petryshyn WV, Williamson, Jr. TE. Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings. J Math Anal Appl. 1973;43:459–497. doi: 10.1016/0022-247X(73)90087-5
   Web of Science ®Google Scholar
• Outlaw C. Mean value iteration of nonexpansive mappings in a Banach space. Pacific J Math. 1969;30:747–750. doi: 10.2140/pjm.1969.30.747
   Web of Science ®Google Scholar
• Aoyama K, Kohsaka F. Viscosity approximation process for a sequence of quasi-nonexpansive mappings. Fixed Point Theory Appl. 2014;2014:17, 11 pp.
   Google Scholar
• Borwein JM, Li G, Tam MK. Convergence rate analysis for averaged fixed point iterations in common fixed point problems. SIAM J Opt. 2017;27:1–33. doi: 10.1137/15M1045223
   Web of Science ®Google Scholar
• Cegielski A, Zalas R. Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators. Numer Funct Anal Optim. 2013;34:255–283. doi: 10.1080/01630563.2012.716807
   Web of Science ®Google Scholar
• Cegielski A, Zalas R. Properties of a class of approximately shrinking operators and their applications. Fixed Point Theory. 2014;15:399–426.
   Web of Science ®Google Scholar
• Kiwiel KC, Łopuch B. Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM J Optim. 1997;7:1084–1102. doi: 10.1137/S1052623495279569
   Web of Science ®Google Scholar
• Kohlenbach U, López-Acedo G, Nicolae A. Moduli of regularity and rates of convergence for Fejér monotone sequences, arXiv:1711.02130v1.
   Google Scholar
• Maingé PE. Inertial iterative process for fixed points of certain quasi-nonexpansive mappings. Set-Valued Anal. 2007;15:67–79. doi: 10.1007/s11228-006-0027-3
   Google Scholar
• Reich S, Salinas S. Metric convergence of infinite products of operators in Hadamard spaces. J Nonlinear Convex Anal. 2017;18:331–345.
   Web of Science ®Google Scholar
• Deutsch F. Best approximation in inner product spaces. New York: Springer-Verlag; 2001.
   Google Scholar
• Yosida K. Functional analysis. 5th ed. Berlin: Springer-Verlag; 1978.
   Google Scholar
• Kress R. Linear integral equations. 3rd ed. Applied Mathematical Sciences, Vol. 82. New York: Springer; 2014.
   Google Scholar
• Debnath L, Mikusiński P. Hilbert spaces with applications. 3rd ed. Amsterdam: Elsevier; 2005
   Google Scholar
• Baillon JB, Bruck RE, Reich S. On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston J Math. 1978;4:1–9.
   Google Scholar