A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Linear Convergence of an Iterative Algorithm for Solving the Multiple-Sets Split Feasibility Problem
2019
Mathematics
Preserved Fulltext
In this paper, we propose the simultaneous sub-gradient projection algorithm with the dynamic step size (SSPA for short) for solving the multiple-sets split feasibility problem (MSSFP for short) and investigate its linear convergence. We involve a notion of bounded linear regularity for the MSSFP and construct several sufficient conditions to prove the linear convergence for the SSPA. In particular, the SSPA is an easily calculated algorithm that uses orthogonal projection onto half-spaces.
doi:10.3390/math7070644
fatcat:p64pigxzcjbdbkerz6ryazpbwq