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.

Uložené v:
Podrobná bibliografia
Vydané v:Optimization Ročník 69; číslo 2; s. 269 - 281
Hlavní autori: Yao, Yonghong, Postolache, Mihai, Zhu, Zhichuan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia Taylor & Francis 01.02.2020
Taylor & Francis LLC
Predmet:
Algorithms
Feasibility
gradient method
iterative algorithm
Iterative algorithms
Multiple-sets split feasibility problem
projection
ISSN:0233-1934, 1029-4945
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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