.png){kind=icon}
.png){kind=icon}
Return
A new accelerated self-adaptive projection algorithm for multiple output split feasibility problems
.png){kind=icon}
PRE
AI
DOI：10.1080/02331934.2026.2649821.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an accelerated self-adaptive projection algorithm designed to solve a class of split convex feasibility problem involving several output sets within real Hilbert spaces. The proposed approach relies on the projection method for the associated variational inequalities and incorporates self-adaptive step sizes, that do not require knowledge of the norms of the shift operators and have positive lower bounds. We establish the convergence of the sequences produced by the method. Additionally, numerical experiments have been conducted to evaluate the performance of the proposed methods in comparison with several recently developed algorithms.
Keywords:
Project method
split convex feasibility
variational inequality
self-adaptive stepsize
inertial technique
