This work proposes an algorithm addressing split feasibility problems, improving convergence rates in Hilbert spaces, indicating a potential for better numerical results.
In this work, we propose a double inertial pre-conditioning CQ Algorithm for split feasibility problem in real Hilbert spaces, in which, we use the double inertial steps and new stepsizes to speed up the convergent rate. We also compute the only one projection onto the nonempty closed convex set C in our proposed method. These help improve the numerical results. Next, we establish the weak convergence of the sequence generated by our method. Finally, we use a numerical experiment to demonstrate our theoretical results.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: