.png){kind=icon}
.png){kind=icon}
Return
An accelerated relaxed algorithm for the split feasibility problem with multiple output sets in Hilbert spaces
.png){kind=icon}
PRE
AI
DOI：10.1007/s40314-026-03704-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an accelerated and relaxed algorithm for solving the Split Feasibility Problem with Multiple Output Sets (SFP-MOS) in real Hilbert spaces. The method features an alternated inertial extrapolation scheme embedded in a two-term conjugate-gradient-like direction, which improves stability and convergence efficiency. An adaptive step-size rule is employed, avoiding the need for operator norm evaluations or costly line searches. We prove strong convergence of the generated sequence to the minimum-norm solution under mild assumptions. The algorithm is applied to elastic net regularization and image classification tasks. Numerical experiments demonstrate its robustness, computational efficiency, and superior performance compared to several state-of-the-art methods in terms of generalization and runtime.
Keywords:
Split feasibility problem
Multiple output sets
Hilbert space
Inertial method
Conjugate gradient direction
Adaptive step size
Strong convergence
Journal
C
IF:
0
Papers:
266
Citations:
0