Gradient methods with selection technique for the multiple-sets split feasibility problem
In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms are based on the gradient method with selection technique. Weak and strong convergence theorems are demonstrated.
Saved in:
| Published in: | Optimization Vol. 69; no. 2; pp. 269 - 281 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Philadelphia
Taylor & Francis
01.02.2020
Taylor & Francis LLC |
| Subjects: | |
| ISSN: | 0233-1934, 1029-4945 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms are based on the gradient method with selection technique. Weak and strong convergence theorems are demonstrated. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0233-1934 1029-4945 |
| DOI: | 10.1080/02331934.2019.1602772 |