A new relaxed method for the split feasibility problem in Hilbert spaces

In this paper, we introduce a new relaxed method for solving the split feasibility problem in Hilbert spaces. In our method, the projection to the halfspace is replaced by the one to the intersection of two halfspaces. We give convergence of the sequence generated by our method under some suitable a...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 73; no. 5; pp. 1417 - 1432
Main Authors Yu, Hai, Wang, Fenghui
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis 03.05.2024
Taylor & Francis LLC
Subjects
Algorithms
CQ algorithm
Feasibility
Hilbert space
projection
relaxed CQ algorithm
Split feasibility problem
Online AccessGet full text

Cover

More Information
Summary:In this paper, we introduce a new relaxed method for solving the split feasibility problem in Hilbert spaces. In our method, the projection to the halfspace is replaced by the one to the intersection of two halfspaces. We give convergence of the sequence generated by our method under some suitable assumptions. Finally, we give a numerical example for illustrating the efficiency and implementation of our algorithms in comparison with existing algorithms in the literature.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2022.2158036