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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-01-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | http://awstest.aimspress.com/article/doi/10.3934/math.2021163?viewType=HTML |