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

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 condit...

Full description

Saved in:
Bibliographic Details
Published inAIMS mathematics Vol. 6; no. 3; pp. 2690 - 2703
Main Authors Suantai, Suthep, Kesornprom, Suparat, Pholasa, Nattawut, Cho, Yeol Je, Cholamjiak, Prasit
Format Journal Article
LanguageEnglish
Published AIMS Press 01.01.2021
Subjects
cq-algorithm
hilbert space
linesearch
signal recovery
split feasibility problem
Online AccessGet full text
ISSN2473-6988
2473-6988
DOI10.3934/math.2021163

Cover

More Information
Summary: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.
ISSN:2473-6988
2473-6988
DOI:10.3934/math.2021163