Vol. 21(2020) No. 2

 

 

  Modified relaxed CQ algorithms for split feasibility and split equality problems in Hilbert spaces
 
Home
Volumes Selection

Fixed Point Theory, Volume 21, No. 2, 2020, 819-832, July 1st, 2020

DOI: 10.24193/fpt-ro.2020.2.58

Authors: Hai Yu and Fenghui Wang

Abstract: In this paper, we investigate the split feasibility problem (SFP) and the split equality problem (SEP) in Hilbert spaces. Motivated by the technique of relaxed projections, we respectively propose a modified relaxed CQ algorithm for the SFP and a modified relaxed alternating CQ algorithm for the SEP. Under standard assumptions, we show that the proposed algorithms converge weakly to a solution of the SFP and the SEP, respectively. Finally, we conduct some numerical experiments to demonstrate the advantage of our proposed algorithms.

Key Words and Phrases: Split feasibility problem, split equality problem, CQ algorithm, projection.

2010 Mathematics Subject Classification: 47J25, 47J20, 47H10, 49N45, 65J15.

Published on-line: July 1st, 2020.

Abstract pdf          Fulltext pdf

Back to volume's table of contents


Home | Indexing-Abstracting | Aims and Scope | Editors | Editorial Board | Published Volumes | Instructions for authors | Subscription | Reviewers Ackn. | Secretaries | FPT Conferences | FPT Book Review