Back to Search
Start Over
Self-adaptive algorithms for solving split feasibility problem with multiple output sets.
- Source :
-
Numerical Algorithms . Feb2023, Vol. 92 Issue 2, p1335-1366. 32p. - Publication Year :
- 2023
-
Abstract
- In this paper, we study the split feasibility problem with multiple output sets in Hilbert spaces. For solving the aforementioned problem, we propose two new self-adaptive relaxed CQ algorithms which involve computing of projections onto half-spaces instead of computing onto the closed convex sets, and it does not require calculating the operator norm. We establish a weak and a strong convergence theorems for the proposed algorithms. We apply the new results to solve some other problems. Finally, we present some numerical examples to show the efficiency and accuracy of our algorithm compared to some existing results. Our results extend and improve some existing methods in the literature. [ABSTRACT FROM AUTHOR]
- Subjects :
- *HILBERT space
*CONVEX sets
*ALGORITHMS
*PROBLEM solving
*FEASIBILITY studies
Subjects
Details
- Language :
- English
- ISSN :
- 10171398
- Volume :
- 92
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Numerical Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 161271838
- Full Text :
- https://doi.org/10.1007/s11075-022-01343-6