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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization Jg. 69; H. 2; S. 269 - 281
Hauptverfasser: Yao, Yonghong, Postolache, Mihai, Zhu, Zhichuan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Taylor & Francis 01.02.2020
Taylor & Francis LLC
Schlagworte:
Algorithms
Feasibility
gradient method
iterative algorithm
Iterative algorithms
Multiple-sets split feasibility problem
projection
ISSN:0233-1934, 1029-4945
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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