Three-step projective methods for solving the split feasibility problems

dc.contributor.authorEiamniran, Nontawat
dc.contributor.authorPholasa, Nanttawut
dc.contributor.authorCholamjak, Prasit
dc.date.accessioned2024-07-12T20:49:14Z
dc.date.available2024-07-12T20:49:14Z
dc.date.issued2019en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractIn 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.en_US
dc.identifier.citationEiamniran, 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.en_US
dc.identifier.endpage100en_US
dc.identifier.isbn978-605-2124-29-1
dc.identifier.startpage100en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2144
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciences (ICMS 2019)en_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY01508
dc.subjectSelf-adaptive methoden_US
dc.subjectSplit feasibility problemen_US
dc.subjectConvergence theoremsen_US
dc.subjectHilbert spaceen_US
dc.subjectCQ-algorithmen_US
dc.titleThree-step projective methods for solving the split feasibility problemsen_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar