Three-step projective methods for solving the split feasibility problems

Three-step projective methods for solving the split feasibility problems

© 2019 by the authors. In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are esta...

Full description

Saved in:
Bibliographic Details
Main Authors: Suthep Suantai, Nontawat Eiamniran, Nattawut Pholasa, Prasit Cholamjiak
Format: Journal
Published: 2019
Subjects:
Mathematics
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070438563&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/66704
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-66704
record_format dspace
spelling th-cmuir.6653943832-667042019-09-16T12:55:42Z Three-step projective methods for solving the split feasibility problems Suthep Suantai Nontawat Eiamniran Nattawut Pholasa Prasit Cholamjiak Mathematics © 2019 by the authors. In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are established under mild conditions. Numerical experiments are provided to show the efficiency in signal processing. Some comparisons to various methods are also provided in this paper. 2019-09-16T12:55:42Z 2019-09-16T12:55:42Z 2019-01-01 Journal 22277390 2-s2.0-85070438563 10.3390/math7080712 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070438563&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/66704
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Mathematics
spellingShingle Mathematics
Suthep Suantai
Nontawat Eiamniran
Nattawut Pholasa
Prasit Cholamjiak
Three-step projective methods for solving the split feasibility problems
description © 2019 by the authors. In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are established under mild conditions. Numerical experiments are provided to show the efficiency in signal processing. Some comparisons to various methods are also provided in this paper.
format Journal
author Suthep Suantai
Nontawat Eiamniran
Nattawut Pholasa
Prasit Cholamjiak
author_facet Suthep Suantai
Nontawat Eiamniran
Nattawut Pholasa
Prasit Cholamjiak
author_sort Suthep Suantai
title Three-step projective methods for solving the split feasibility problems
title_short Three-step projective methods for solving the split feasibility problems
title_full Three-step projective methods for solving the split feasibility problems
title_fullStr Three-step projective methods for solving the split feasibility problems
title_full_unstemmed Three-step projective methods for solving the split feasibility problems
title_sort three-step projective methods for solving the split feasibility problems
publishDate 2019
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070438563&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/66704
_version_ 1681426504819408896

Similar Items