Abstract
In this paper, we propose an alternated multi-step inertial iterative algorithm for solving the split feasibility problem involving two bounded linear operators in Hilbert spaces. The proposed algorithm adopts self-adaptive step size and the step size is bounded away from zero. Under some mild conditions, the strong convergence of the sequence generated by the proposed algorithm is established. Finally, the numerical experiments are presented to verify the effectiveness and superiority of our proposed algorithm. Our results are innovative and can be an enrichment to the recently published results in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
References
Bauschke HH, Combettes PL (2017) Convex analysis and monotone operator theory in Hilbert spaces, 2nd edn. Springer, Berlin
Byrne C (2002) Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl 18(2):441–453
Byrne C (2003) A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl 20(1):103–120
Censor Y, Elfving T (1994) A multiprojection algorithm using Bregman projections in a product space. Numer Algor 8(2):221–239
Censor Y, Segal A (2009) The split common fixed point problem for directed operators. J Convex Anal 16(2):587–600
Censor Y, Bortfeld T, Martin B, Trofimov A (2006) A unified approach for inversion problems in intensity-modulated radiation therapy. Phys Med Biol 51(10):2353–2365
Dong QL, He S, Rassias MT (2019) MiKM: multi-step inertial krasnosel’skiǐ-mann algorithm and its applications. J Glob Optim 73:801–824
Dong QL, Liu L, Qin X, Yao JC (2023) An alternated inertial general splitting method with linearization for the split feasibility problem. Optimization 79(10):2585–2607
Duan P, Zhang Y (2023) Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems. Optimization 72(10):2517–2545
Iutzeler F, Malick J (2018) On the proximal gradient algorithm with alternated inertia. J Optim Theory Appl 176(3):688–710
Jailoka P, Suanoom C, Khuangsatung W, Suantai S (2024) Self-adaptive CQ-type algorithms for the split feasibility problem involving two bounded linear operators in Hilbert spaces. Carpath J Math 40(1):77–98
Kangtunyakarn A (2019) Iterative scheme for finding solutions of the general split feasibility problem and the general constrained minimization problems. Filomat 33(1):233–243
Liang JW (2016) Convergence rates of first-order operator splitting methods. PhD thesis, Normandie Université; GREYC CNRS UMR 6072
López G, Martín-Márquez V, Wang FH, Xu HK (2012) Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl 28(8):085004
Ma XJ, Liu HW (2022) An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces. J Appl Math Comput: 1–19
Maingé PE (2008) Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set Valued Anal 16(7):899–912
Mu Z, Peng Y (2015) A note on the inertial proximal point method. Stat Optim Inf Comput 3(3):241–248
Osilike MO, Aniagbosor SC (2000) Weak and strong convergence theorems for fixed points of asymptotically nonexpensive mappings. Math Comput Model 32(10):1181–1191
Polyak BT (1964) Some methods of speeding up the convergence of iteration methods. Ussr Comput Math Math Phys 4(5):1–17
Sahu DR, Cho YJ, Dong QL, Kashyap MR, Li XH (2021) Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces. Numer Algor 87(3):1075–1095
Shehu Y, Dong QL, Liu LL (2021) Global and linear convergence of alternated inertial methods for split feasibility problems. Rev R Acad Cienc 115:1–26
Tan B, Qin X, Wang X (2024) Alternated inertial algorithms for split feasibility problems. Numer Algor 95(2):773–812
Wang F (2018) Polyak’s gradient method for split feasibility problem constrained by level sets. Numer Algor 77(3):925–938
Xu HK (2002) Iterative algorithms for nonlinear operators. J Lond Math Soc 66(1):240–256
Acknowledgements
The authors thank the responsible editor and anonymous reviewers for their careful reading.
Funding
This work was supported by the National Natural Science Foundation of China (No. 12261019) and Natural Science Basic Research Program Project of Shaanxi Province No. 2024JCYBMS-019).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wang, M., Liu, H. & Yang, J. Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces. Comp. Appl. Math. 44, 4 (2025). https://doi.org/10.1007/s40314-024-02960-8
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-024-02960-8