New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces
New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces
The split feasibility problem <math xmlns="http://www.w3.org/1998/Math/MathML" id="M1"> <mfenced open="(" close=")" separators="|"> <mrow> <mtext>SFP</mtext> </mrow> </mfenced> </math> has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed <math xmlns="http://www.w3.org/1998/Math/MathML" id="M2"> <mi>C</mi> <mi>Q</mi> </math> algorithms for solving the split …