A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces

© 2018, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We...

Full description

Saved in:

Bibliographic Details
Main Authors:	Nguyen The Vinh, Prasit Cholamjiak, Suthep Suantai
Format:	Journal
Published:	2019
Subjects:	Mathematics
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85069661868&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65672
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-65672
record_format	dspace
spelling	th-cmuir.6653943832-656722019-08-05T04:39:13Z A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces Nguyen The Vinh Prasit Cholamjiak Suthep Suantai Mathematics © 2018, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will show that the sequence generated by the proposed algorithm converges in norm to the minimum-norm solution of the SFP under appropriate conditions. In addition, we give some numerical examples to verify the implementation of our method. Our result improves and complements many known related results in the literature. 2019-08-05T04:39:13Z 2019-08-05T04:39:13Z 2019-09-15 Journal 21804206 01266705 2-s2.0-85069661868 10.1007/s40840-018-0614-0 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85069661868&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65672
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Mathematics
spellingShingle	Mathematics Nguyen The Vinh Prasit Cholamjiak Suthep Suantai A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
description	© 2018, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will show that the sequence generated by the proposed algorithm converges in norm to the minimum-norm solution of the SFP under appropriate conditions. In addition, we give some numerical examples to verify the implementation of our method. Our result improves and complements many known related results in the literature.
format	Journal
author	Nguyen The Vinh Prasit Cholamjiak Suthep Suantai
author_facet	Nguyen The Vinh Prasit Cholamjiak Suthep Suantai
author_sort	Nguyen The Vinh
title	A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
title_short	A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
title_full	A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
title_fullStr	A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
title_full_unstemmed	A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
title_sort	new cq algorithm for solving split feasibility problems in hilbert spaces
publishDate	2019
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85069661868&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65672
_version_	1681426312523153408

A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces

Similar Items