Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators

References

• Censor Y, Elfving T. A multiprojection algorithm using Bregman projection in a product space. Numer Algorithms. 1994;8:221–239.
   Google Scholar
• Byrne C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2004;20:103–120.
   Web of Science ®Google Scholar
• Byrne C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 2002;18:441–453.
   Web of Science ®Google Scholar
• Censor Y, Elfving T, Kopf N, et al. The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 2005;21:2071–2084.
   Web of Science ®Google Scholar
• López G, Martin V, Wang F, et al. Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 2012;28:085004.
   Web of Science ®Google Scholar
• Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. Optim Lett. 2020; 15:2109–2126. DOI:10.1007/s11590-020-01603-1.
   Web of Science ®Google Scholar
• Sahu DR, Cho YJ, Dong QL, et al. Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces. Numer Algorithms. 2021; 87:1075–1095. DOI: 10.1007/s11075-020-00999-2.
   Google Scholar
• Kesornprom S, Pholasa N, Cholamjiak P. On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem. Numer Algorithms. 2020;84:997–1017.
   Web of Science ®Google Scholar
• Dong QL, Tang YC, Cho YJ, et al. ”Optimal“ choice of the step length of the projection and contraction methods for solving the split feasibility problem. J Global Optim. 2018;71:341–360.
   Web of Science ®Google Scholar
• Dong QL, Yuan HB, Cho YJ, et al. Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. Optim Lett. 2018;12:87–102.
   Web of Science ®Google Scholar
• Anh PK, Vinh NT, Dung VT. A new self-adaptive CQ algorithm with an application to the lasso problem. J Fixed Point Theory Appl. 2018;20:1–10.
   Web of Science ®Google Scholar
• Fukushima M. A relaxed projection method for variational inequalities. Math Program. 1986;35:58–70.
   Web of Science ®Google Scholar
• Yang Q. On variable-step relaxed projection algorithm for variational inequalities. J Math Anal Appl. 2005;302:166–179.
   Web of Science ®Google Scholar
• Yen LH, Huyen NTT, Muu LD. A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models. J Global Optim. 2019;73:849–868.
   Web of Science ®Google Scholar
• Gibali A, Mai DT, Vinh NT. A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications. J Ind Manag Optim. 2019;15:963–984.
   Web of Science ®Google Scholar
• Moudafi A, Thakur BS. Solving proximal split feasibility problems without prior knowledge of operator norms. Optim Lett. 2014;8:2099–2110.
   Web of Science ®Google Scholar
• Sahu DR, Ansari QH, Yao JC. Convergence of inexact Mann iterations generated by nearly nonexpansive sequences and applications. Numer Funct Anal Optim. 2016;37:1312–1338.
   PubMed Web of Science ®Google Scholar
• Wang F. On the convergence of CQ algorithm with variable steps for the split equality problem. Numer Algorithms. 2017;74:927–935.
   Web of Science ®Google Scholar
• Reich S, Tuyeni TM, Ha MTN. An optimization approach to solving the split feasibility problem in Hilbert spaces. J Global Optim. 2020;79:1–16. DOI: 10.1007/s10898-020-00964-2.
   Web of Science ®Google Scholar
• Yen LH, Muu LD, Huyen NTT. An algorithm for a class of split feasibility problems: application to a model in electricity production. Math Meth Oper Res. 2016;84:549–565.
   Web of Science ®Google Scholar
• Nesterov Y. A method for solving the convex programming problem with convergence rate O(1/k2). Dokl Akad Nauk SSSR. 1983;269:543–547.
   Web of Science ®Google Scholar
• Polyak BT. Some methods of speeding up the convergence of iteration methods. U S S R Comput Math Math Phys. 1964;4:1–17.
   Google Scholar
• Alvarez F, Attouch H. An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 2001;9:3–11.
   Google Scholar
• Dang Y, Sun J, Xu H. Inertial accelerated algorithm for solving a split feasibility problem. J Ind Manag Optim. 2017;13:1383–1394.
   Web of Science ®Google Scholar
• Alvarez F. Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space. SIAM J Optim. 2004;14:773–782.
   Web of Science ®Google Scholar
• Shehu Y, Iyiola OS, Ogbuisi FU. Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing. Numer Algorithms. 2020;83:1321–1347.
   Web of Science ®Google Scholar
• Shehu Y, Iyiola OS, Thong DV, et al. An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems. Math Meth Oper Res. 2021;93:213–242.
   Web of Science ®Google Scholar
• Iyiola OS, Ogbuisi FU, Shehu Y. An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems. Calcolo. 2018;55:1–22.
   Web of Science ®Google Scholar
• Shehu Y, Iyiola OS. Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence. Appl Numer Math. 2020;157:315–337.
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York (NY): Springer; 2011.
   Google Scholar
• Agarwal RP, Regan DO, Sahu DR. Fixed point theory for lipschitzian-type mappings with applications. Topological fixed point theory and its applications. New York (NY): Springer; 2009 .
   Google Scholar
• Vinh N, Cholamjiak P, Suantai S. A new CQ algorithm for solving split feasibility problems in Hilbert spaces. Bull Malays Math Sci Soc. 2018;42:2517–2534.
   Web of Science ®Google Scholar
• Xu HK. Iterative methods for solving the split feasibility in infinite-dimensional Hilbert spaces. Inverse Probl. 2010;26:105018.
   Web of Science ®Google Scholar
• Osilike MO, Aniagbosor SC. Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings. Math Comput Model. 2000;32:1181–1191.
   Web of Science ®Google Scholar
• Wen M, Peng JG, Tang YC. A cyclic and simultaneous iterative method for solving the multiple sets split feasibility problem. J Optim Theory Appl. 2015;166:844–860.
   Web of Science ®Google Scholar
• Wang J, Hu Y, Yu CKW, et al. A family of projection gradient methods for solving the multiple-Sets split feasibility problem. J Optim Theory Appl. 2019;183:520–534.
   Web of Science ®Google Scholar
• Tibshirani R. Regression shrinkage and selection via the LASSO. J R Stat Soc Ser B Stat Methodol. 1996;58:267–288.
   Web of Science ®Google Scholar