Result: A relaxed projection method using a new linesearch for the split feasibility problem

Title:
A relaxed projection method using a new linesearch for the split feasibility problem
Source:
AIMS Mathematics, Vol 6, Iss 3, Pp 2690-2703 (2021)
Publisher Information:
American Institute of Mathematical Sciences (AIMS), 2021.
Publication Year:
2021
Document Type:
Academic journal Article<br />Other literature type
ISSN:
2473-6988
DOI:
10.3934/math.2021163
DOI:
10.60692/by1h3-p6t22
DOI:
10.60692/v8hyc-9bg76
Rights:
CC BY
Accession Number:
edsair.doi.dedup.....f12df48dee93ac92d07eba95a044ca2f
Database:
OpenAIRE

Further Information

In this work, we propose a new relaxed projection algorithm for the split feasibility problem with a new linesearch. The proposed method does not require the computation on the matrix inverse and the largest eigenvalue of the matrix. We then prove some weak convergence theorems under suitable conditions in the framework of Hilbert spaces. Finally, we give some numerical examples in signal processing to validate the theoretical analysis results. The obtained results improve the corresponding results in the literature.