2019
DOI: 10.1186/s13660-019-1971-4
|View full text |Cite
|
Sign up to set email alerts
|

New inertial algorithm for solving split common null point problem in Banach spaces

Abstract: Inspired by the works of Alvarez propose a new inertial algorithm for solving split common null point problem without the prior knowledge of the operator norms in Banach spaces. Under mild and standard conditions, the weak and strong convergence theorems of the proposed algorithms are obtained. Also the split minimization problem is considered as the application of our results. Finally, the performances and computational examples are presented, and a comparison with related algorithms is provided to illustrate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 44 publications
0
11
0
Order By: Relevance
“…We have included several numerical examples which show the efficiency and reliability of Algorithm 3.1 and Algorithm 3.2. We have also made comparisons of Algorithm 3.1 and Algorithm 3.2 with other four algorithms in Sitthithakerngkiet et al [27], Kazimi and Riviz [12], Tang [28], Dadashi and Postolach [8] confirming some advantages of our novel inertial algorithms.…”
Section: Discussionmentioning
confidence: 64%
See 3 more Smart Citations
“…We have included several numerical examples which show the efficiency and reliability of Algorithm 3.1 and Algorithm 3.2. We have also made comparisons of Algorithm 3.1 and Algorithm 3.2 with other four algorithms in Sitthithakerngkiet et al [27], Kazimi and Riviz [12], Tang [28], Dadashi and Postolach [8] confirming some advantages of our novel inertial algorithms.…”
Section: Discussionmentioning
confidence: 64%
“…where A = B 1 and B = T * (I − J λ B 2 )T with γ− cocoercive, γ = 1 T * T . In addition to showing the behavior of our algorithms, the results of Sitthithakerngkiet et al [27], Kazimi and Riviz [12] without inertial process and Tang [28] with general inertial method are compared. For the experiment setting, we choose the following parameters: T ∈ R m * n is generated randomly with m = 2 6 , 2 7 , n = 2 8 , 2 9 , x 0 ∈ R n is K-spikes (K = 40, 60) with amplitude ±1 distributed in whole domain randomly.…”
Section: Variational Inequality Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…Lemma (Tang 37 ) Let H be a real Hilbert space, E be a strictly convex reflexive and smooth Banach space and J be the normalized duality mapping on E . Let B 1 : H → 2 H and B2:E2E be maximal operators such that B11false(0false) and B21false(0false), respectively.…”
Section: Resultsmentioning
confidence: 99%