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

A regularization algorithm for a splitting feasibility problem in Hilbert spaces

Abstract: In this article, we investigate a split feasibility problem via a regularization iterative algorithm. Strong convergence theorems of solutions for the split feasibility are established in the framework of Hilbert spaces. We also apply our main results to the split equality problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…So far, some authors have studied SFP ( 1.1 ) [ 5 – 17 ]. Others have also found a lot of algorithms to study the split equality fixed point problem and the minimization problem [ 18 – 20 ].…”
Section: Introductionmentioning
confidence: 99%
“…So far, some authors have studied SFP ( 1.1 ) [ 5 – 17 ]. Others have also found a lot of algorithms to study the split equality fixed point problem and the minimization problem [ 18 – 20 ].…”
Section: Introductionmentioning
confidence: 99%