Three-step projective methods for solving the split feasibility problems
Küçük Resim Yok
Tarih
2019
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
In this work, we focus on studying the method for solving the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ-algorithm and the self-adaptive technique, we introduce new three-step iterative schemes for solving the split feasibility problem. Then both weak and strong convergence theorems are proved under some mild conditions. Numerical examples are given to show its efficiency in signal processing. Some comparison to various methods are also provided in this paper.
Açıklama
Anahtar Kelimeler
Self-adaptive method, Split feasibility problem, Convergence theorems, Hilbert space, CQ-algorithm
Kaynak
International Conference of Mathematical Sciences (ICMS 2019)
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Eiamniran, N., Pholasa, N. ve Cholamjak, P. (2019). Three-step projective methods for solving the split feasibility problems. International Conference of Mathematical Sciences (ICMS 2019). s. 100.
