2021
DOI: 10.22436/jnsa.015.02.04
|View full text |Cite
|
Sign up to set email alerts
|

Inertial hybrid S-iteration algorithm for fixed point of asymptotically nonexpansive mappings and equilibrium problems in a real Hilbert space

Abstract: In this paper, we introduce an inertial hybrid S-iteration algorithm for two asymptotically nonexpansive mappings and equilibrium problems in a real Hilbert space. Strong convergence of the iterative scheme is established. Our results improve and extend many recent results in the literature.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Also, A$$ A $$ satisfies () with τ=13$$ \tau =\frac{1}{3} $$ and 0A1false(0false)$$ 0\in {A}^{-1}(0) $$. The performance of our proposed Algorithm () is compared with that of the algorithms of Husain and Asad [23] and Harbau and Ahmad [51] with T1=T2=T$$ {T}_1={T}_2=T $$, which are as follows, respectively, {left leftarrayarrayd0H,arrayun=Tbndn,arraysn=(1ςn)un+ςnTun,arraydn+1=Tsn,n0,$$ \left\{\begin{array}{l}{d}_0\in H,\\ {}{u}_n={T}_{b_n}{d}_n,\\ {}{s}_n=\left(1-{\varsigma}_n\right){u}_n+{\varsigma}_nT{u}_n,\\ {}{d}_{n+1}=T{s}_n,\kern0.30em \forall n\ge 0,\end{array}\right. $$ and {left leftarrayarrayd0,d1S,arrayhn=dn+λn(dndn1),…”
Section: Numerical Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Also, A$$ A $$ satisfies () with τ=13$$ \tau =\frac{1}{3} $$ and 0A1false(0false)$$ 0\in {A}^{-1}(0) $$. The performance of our proposed Algorithm () is compared with that of the algorithms of Husain and Asad [23] and Harbau and Ahmad [51] with T1=T2=T$$ {T}_1={T}_2=T $$, which are as follows, respectively, {left leftarrayarrayd0H,arrayun=Tbndn,arraysn=(1ςn)un+ςnTun,arraydn+1=Tsn,n0,$$ \left\{\begin{array}{l}{d}_0\in H,\\ {}{u}_n={T}_{b_n}{d}_n,\\ {}{s}_n=\left(1-{\varsigma}_n\right){u}_n+{\varsigma}_nT{u}_n,\\ {}{d}_{n+1}=T{s}_n,\kern0.30em \forall n\ge 0,\end{array}\right. $$ and {left leftarrayarrayd0,d1S,arrayhn=dn+λn(dndn1),…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In this manuscript, we consider more general problems than those considered by Suantai and Tiammee [50] and Harbaua and Ahmadb [51]. But in the second example, we wish to consider a special case of problems which can be handled by our Algorithm.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation