Open AccessA relaxed projection method using a new linesearch for the split feasibility problem
Author(s) -
Suthep Suantai,
Suparat Kesornprom,
Nattawut Pholasa,
Yeol Je Cho,
Prasit Cholamjiak
Publication year - 2021
Publication title -
aims mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.329
H-Index - 15
ISSN - 2473-6988
DOI - 10.3934/math.2021163
Subject(s) - eigenvalues and eigenvectors , convergence (economics) , inverse , computation , projection (relational algebra) , matrix (chemical analysis) , algorithm , mathematics , hilbert space , inverse problem , mathematical optimization , computer science , mathematical analysis , geometry , physics , materials science , quantum mechanics , economics , composite material , economic growth
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.