Convergence of a Tri-Inertial Split-Averaged λ-Iteration Scheme in Cone Banach Spaces
Keywords:
Fixed point theory, cone Banach spaces, multi-inertial iteration, weak contraction, Tri-Inertial Split-Averaged λ-IterationAbstract
We introduce a novel multi-inertial λ-iteration scheme in cone Banach spaces, using a tri-Inertial split-averaged λ-iteration process, which we denote as TISA-λ-iteration. Under mild assumptions including quasi-nonexpansiveness, weak contraction, and compatibility of mappings, we establish convergence theorems demonstrating both existence and uniqueness of fixed points. A simple one-dimensional example is used to illustrate theoretically and numerically that the proposed scheme accelerates convergence compared to Krasnoselskii-Mann, and remains competitive with recent two-step inertial frameworks of Cortild–Peypouquet. Our method’s added flexibility allows it to adapt to operator geometry, manage multiple error terms, and encompass prior methods as special cases. We discuss the implications of this flexibility,
show visual and quantitative comparisons, and indicate directions for further optimization and experimental validation.
References
[1] Alvarez, F.; Attouch, H. An inertial proximal method for maximal monotone operators. Set-Valued Anal. 9 (2001), 3–11.
[2] Bot, R.I.; Csetnek, E.R.; Heinrich, A. On the convergence rate improvement of a forward–backward splitting algorithm. J. Math. Anal. Appl. 426 (2015), 400–409.
[3] Cortild, C.; Peypouquet, J. A unified inertial framework for fixed point algorithms. J. Optim. Theory Appl. (2024).
[4] Dong, Q.-L.; Yao, J.C.; Zhang, L. Convergence of a general inertial Mann iteration algorithm. Optim. Lett. 12 (2018), 1027–1042.
[5] Dong, Q.-L.; Yao, J.C.; Xu, Y. Inertial Mann-type iterative algorithms. J. Fixed Point Theory Appl. 24 (2022), 45.
[6] Groetsch, C.W. A note on segmenting Mann iterates. J. Math. Anal. Appl. 40 (1972), 369–372.
[7] Karapinar, E. Fixed point results via generalized contractive mappings in cone metric spaces. J. Nonlinear Convex Anal. 14 (2013), 1099–1110.
[8] Krasnoselskii, M.A. Two remarks on the method of successive approximations. Uspekhi Mat. Nauk 10 (1955), 123–127.
[9] Maingé, P.-E. Convergence theorems for inertial KM-type algorithms. J. Comput. Appl. Math. 219 (2008), 223–236.
[10] Mann, W.R. Mean value methods in iteration. Proc. Amer. Math. Soc. 4 (1953), 506–510.
[11] Opial, Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Amer. Math. Soc. 73 (1967), 591–597.
[12] Polyak, B.T. Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4 (1964), 1–17.
[13] Nesterov, Y. A method for solving the convex programming problem with convergence rate O(1/k2). Soviet Math. Dokl. 27 (1983), 372–376.
[14] Shehu, Y. Convergence analysis of an inertial Krasnoselskii–Mann iteration. Numer. Algorithms 77 (2018), 1113–1135.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Elvin Rada
This work is licensed under a Creative Commons Attribution 4.0 International License.
