Submitted:
06 October 2024
Posted:
07 October 2024
You are already at the latest version
Abstract
Keywords:
MSC: 47H10; 47H09; 47J25; 47J20; 49J40; 65K15
1. Introduction
- (a)
- nonexpansive if
- (b)
- quasi-nonexpansive if and
- (c)
- β-demicontractive if and there exists a positive number such thatfor all and .
- (d)
- strongly quasi-nonexpansive if G is quasi-nonexpansive and whenever is a bounded sequence such that for some
2. Preliminaries
3. Fixed Points and Variational Inequalities
- (I)
-
If and then strongly converges to which is the unique point in that solves the variational inequalityi.e.
- (II)
-
If and then converges strongly to which is the unique point in that solves the variational inequalityi.e.
- (III)
-
If then strongly converges to that is the unique solution of the variational inequalityi.e.
- (I)
-
If then strongly converges to that is the unique point in that solves the variational inequalityi.e.
- (II)
-
If then converges strongly to that is the unique point in that solves the variational inequalityi.e. .
- (III)
-
If then strongly converges to that is the unique solution of the variational inequalityi.e.
- If F is nonexpansive and G is nonspreading, then by Theorem 1 we obtain an improvement of Theorem 4.1 in Iemoto and Takahashi [9], in the sense that for our averaged Halpern type algorithm (8) we have strong convergence, while for the Krasnoselsij-Mann iterative procedure (5) only weak convergence was obtained by Iemoto and Takahashi [9];
- If F is nonexpansive and G is nonspreading, then by Theorem 1 we obtain the main result (i.e., Theorem 14) in Cianciaruso et al. [7];
- If F and G are both nonexpansive, then by Theorem 1 we obtain an improvement of the main result in Takahashi and Tamura [21], in the sense that for our averaged Halpern type algorithm (8) we get strong convergence, while for the Krasnoselsij-Mann iterative procedure (5) only weak convergence is obtained by Takahashi and Tamura [21];
- If F is nonexpansive and G is strongly quasi-nonexpansive, then by Theorem 1 we obtain the main result (i.e., Theorem 3) in Falset et al. [8];
- ...
4. Numerical Illustrations
5. Conclusions
- We have introduced an averaged iterative Halpern type algorithm intended to find a common fixed point for a pair consisting of a nonexpansive mapping and a demicontractive mapping which also solves a certain variational inequality problem;
- We established a strong convergence theorem (Theorem 1) for the sequence generated by our algorithm;
- We extended Theorem 1 to the more general case of a pair of mappings consisting of a k-strictly pseudocontractive mapping F and a -demicontractive mapping G (Theorem 2), by considering the double averaged Halpern type algorithm (32).
- We validated the effectiveness of our general theoretical results by some appropriate numerical experiments, corresponding to part (iii) of Theorem 1, which are reported in Section 4. These results clearly illustrate the progress of our convergence results over existing literature.
- For other related results we refer the reader to Agwu et al. [1], Araveeporn et al. [2], Ceng and Yao [5], Ceng and Yuan [6], Jaipranop and Saejung [10], Kraikaew and Saejung [12], Mebawondu et al. [14], Nakajo et al. [17], Petruşel and Yao [18], Rizvi [19], Sahu et al. [20], Thuy [22], Uba et al. [23], Xu [25], Yao et al. [26,27], Yotkaew et al. [28],...
Acknowledgments
Conflicts of Interest
Funding
Data Availability Statement
References
- Agwu, I.K.; Işık, H.; Igbokwe, D. I. Weak and strong convergence theorems for a new class of enriched strictly pseudononspreading mappings in Hilbert spaces. Fixed Point Theory Algorithms Sci. Eng. 2024, 14. [Google Scholar] [CrossRef]
- Araveeporn, A.; Kheawborisut, A.; Kangtunyakarn, A. Approximating G-variational inequality problem by G-subgradient extragradient method in Hilbert space endowed with graphs. Carpathian J. Math. 2023, 39, 359–369. [Google Scholar] [CrossRef]
- Berinde, V. , Approximating fixed points of demicontractive mappings via the quasi-nonexpansive case. Carpathian J. Math. 2023, 39, 73–84. [Google Scholar] [CrossRef]
- Berinde, V. On a useful lemma that relates quasi-nonexpansive and demicontractive mappings in Hilbert spaces. Creat. Math. Inform. 2024, 33, 7–21. [Google Scholar] [CrossRef]
- Ceng, L.-C.; Yao, J.-C. An extragradient-like approximation method for variational inequality problems and fixed point problems. Appl. Math. Comput. 2007, 190, 205–215. [Google Scholar] [CrossRef]
- Ceng, L.-C.; Yuan, Q. Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems. J. Inequal. Appl. 2019, 20, 274. [Google Scholar] [CrossRef]
- Cianciaruso, F. , Marino G., Rugiano A. and Scardamaglia B., On strong convergence of Halpern’s method using averaged type mappings. J. Appl. Math 2014. [Google Scholar] [CrossRef]
- Falset, J. G, Llorens-Fuster E., Marinob G. and Rugiano A. On strong convergence of Halpern’s method for quasi-nonexpansive mappings in Hilbert spaces. Math. Model. Anal. 2016, 21, 63–82. [Google Scholar] [CrossRef]
- Iemoto, S. and Takahashi W. Approximating common fixed points of nonexpansive mappings and nonspreading mappings in a Hilbert space. Nonlinear Anal. 2009, 71, e2082–e2089. [Google Scholar] [CrossRef]
- Jaipranop, Ch.; Saejung, S. On Halpern-type sequences with applications in variational inequality problems. Optimization 2022, 71, 675–710. [Google Scholar] [CrossRef]
- Khammahawong, K.; Salisu, S. Modified Halpern and viscosity methods for hierarchical variational inequalities on Hadamard manifolds. Comput. Appl. Math. 2024, 43, 1. [Google Scholar] [CrossRef]
- Kraikaew, R.; Saejung, S. Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces. J. Optim. Theory Appl. 2014, 163, 399–412. [Google Scholar] [CrossRef]
- Maingé, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Analysis 2008, 16, 899–912. [Google Scholar] [CrossRef]
- Mebawondu, A.A.; Jolaoso, L.O.; Abass, H.A.; Oyewole, O. K; Aremu, K. O. A strong convergence Halpern-type inertial algorithm for solving system of split variational inequalities and fixed point problems. J. Appl. Anal. Comput. 2021, 11, 2762–2791. [Google Scholar]
- Moudafi, A. Krasnoselski-Mann iteration for hierarchical fixed-point problems. Inverse Problems 2007, 23, 1635–1640. [Google Scholar] [CrossRef]
- Moudafi, A, A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 2011, 74, 4083–4087. [CrossRef]
- Nakajo, K.; Shimoji, K.; Takahashi, W. Strong convergence theorems of Halpern’s type for families of nonexpansive mappings in Hilbert spaces. Thai J. Math. 2009, 7, 49–67. [Google Scholar]
- Petruşel, A.; Yao, J.-C. An extragradient iterative scheme by viscosity approximation methods for fixed point problems and variational inequality problems. Cent. Eur. J. Math. 2009, 7, 335–347. [Google Scholar] [CrossRef]
- Rizvi, S. H. A strong convergence theorem for split mixed equilibrium and fixed point problems for nonexpansive mappings. J. Fixed Point Theory Appl. 2018, 20, 8. [Google Scholar] [CrossRef]
- Sahu, D.R.; Kumar, A.; Wen, C.-F. S-iteration process of Halpern-type for common solutions of nonexpansive mappings and monotone variational inequalities. Filomat 2019, 33, 1727–1746. [Google Scholar] [CrossRef]
- Takahashi, W.; Tamura, T. Convergence theorems for a pair of nonexpansive mappings. J. Convex Anal. 1998, 5, 45–56. [Google Scholar]
- Thuy, N. T. T. A strongly convergent shrinking descent-like Halpern’s method for monotone variational inequality and fixed point problems. Acta Math. Vietnam. 2014, 39, 379–391. [Google Scholar] [CrossRef]
- Uba, M.O.; Onyido, M.A.; Udeani, C.I.; Nwokoro, P. U. A hybrid scheme for fixed points of a countable family of generalized nonexpansive-type maps and finite families of variational inequality and equilibrium problems, with applications. Carpathian J. Math. 2023, 39, 281–292. [Google Scholar] [CrossRef]
- Xu, H. Iterative algorithms for nonlinear operators. J. London Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
- Xu, H.-K. Viscosity method for hierarchical fixed point approach to variational inequalities. Taiwanese J. Math. 2010, 14, 463–478. [Google Scholar] [CrossRef]
- Yao, Y.H.; Liou, Y.-C.; Yao, J.-C. An extragradient method for fixed point problems and variational inequality problems. J. Inequal. Appl. 2007, 12, 38752. [Google Scholar] [CrossRef]
- Yao, Y.H.; Shahzad, N.; Postolache, M.; Yao, J.-C. Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems. Carpathian J. Math. 2024, 40, 753–768. [Google Scholar] [CrossRef]
- Yotkaew, P.; Rehman, H. Ur; Panyanak, B.; Pakkaranang, N. Halpern subgradient extragradient algorithm for solving quasimonotone variational inequality problems. Carpathian J. Math. 2022, 38, 249–262. [Google Scholar] [CrossRef]
- Zeng, L.-C.; Yao, J.-C. Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems. Taiwanese J. Math. 2006, 10, 1293–1303. [Google Scholar] [CrossRef]
- Zhou, H. Convergence theorems of fixed points for κ-strict pseudo-contractions in Hilbert spaces. Nonlinear Anal. 2008, 69, 456–462. [Google Scholar] [CrossRef]
| Iteration (p) | |||
|---|---|---|---|
| 0 | 1.000000 | 0.700000 | 0.100000 |
| 1 | 0.786549 | 0.822542 | 0.774552 |
| 2 | 0.837948 | 0.834349 | 0.839148 |
| 3 | 0.832452 | 0.833106 | 0.832234 |
| 4 | 0.833503 | 0.833354 | 0.833553 |
| 5 | 0.833264 | 0.833303 | 0.833251 |
| 6 | 0.833332 | 0.833321 | 0.833335 |
| 7 | 0.833316 | 0.833319 | 0.833315 |
| 8 | 0.833323 | 0.833322 | 0.833323 |
| 9 | 0.833323 | 0.833323 | 0.833322 |
| 10 | 0.833324 | 0.833324 | 0.833324 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 15 | 0.833327 | 0.833327 | 0.833327 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 20 | 0.833329 | 0.833329 | 0.833329 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 50 | 0.833332 | 0.833332 | 0.833332 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 51 | 0.833332 | 0.833332 | 0.833332 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 111 | 0.833333 | 0.833333 | 0.833333 |
| 112 | 0.833333 | 0.833333 | 0.833333 |
| Iteration (p) | |||
|---|---|---|---|
| 0 | 1.000000 | 0.700000 | 0.100000 |
| 1 | 0.786649 | 0.822642 | 0.774652 |
| 2 | 0.837988 | 0.834389 | 0.839188 |
| 3 | 0.832478 | 0.833133 | 0.832260 |
| 4 | 0.833522 | 0.833373 | 0.833572 |
| 5 | 0.833279 | 0.833318 | 0.833266 |
| 6 | 0.833344 | 0.833330 | 0.833348 |
| 7 | 0.833326 | 0.833330 | 0.833325 |
| 8 | 0.833332 | 0.833331 | 0.833332 |
| 9 | 0.833332 | 0.833331 | 0.833332 |
| 10 | 0.833332 | 0.833331 | 0.833332 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 15 | 0.833332 | 0.833332 | 0.833332 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 20 | 0.833332 | 0.833332 | 0.833332 |
| ⋯ | ⋯ | ⋯ | ⋯ |
| 26 | 0.833333 | 0.833333 | 0.833333 |
| 27 | 0.833333 | 0.833333 | 0.833333 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).