2022
DOI: 10.48550/arxiv.2203.11003
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On modified Halpern and Tikhonov-Mann iterations

Abstract: We show that the asymptotic regularity and the strong convergence of the modified Halpern iteration due to T.-H. Kim and H.-K. Xu and studied further by A. Cuntavenapit and B. Panyanak and the Tikhonov-Mann iteration introduced by H. Cheval and L. Leuştean as a generalization of an iteration due to Y. Yao et al. that has recently been studied by Bot ¸et al.can be reduced to each other in general geodesic settings. This, in particular, gives a new proof of the convergence result in Bot ¸et al. together with a g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…In [6], the authors and Kohlenbach computed linear rates of (T −)asymptotic regularity, for a special choice of the parameter sequences, for the modified Halpern iteration, a generalization of the Halpern iteration. One gets immediately linear rates for this iteration too.…”
Section: Halpern Iterationmentioning
confidence: 99%
See 1 more Smart Citation
“…In [6], the authors and Kohlenbach computed linear rates of (T −)asymptotic regularity, for a special choice of the parameter sequences, for the modified Halpern iteration, a generalization of the Halpern iteration. One gets immediately linear rates for this iteration too.…”
Section: Halpern Iterationmentioning
confidence: 99%
“…As an immediate consequence, linear rates for the Halpern iteration are obtained. The lemma of Sabach and Shtern has since been employed to obtain linear rates of asymptotic regularity for the Tikhonov-Mann and modified Halpern iterations in [6] and for the alternating Halpern-Mann iteration in [16]. The following lemma is a slight reformulation of [18,Lemma 3], proved in [16,Lemma 2.8].…”
Section: Introductionmentioning
confidence: 99%