In this paper we present several relaxed inexact projection methods for the split feasibility problem (SFP). Each iteration of the first proposed algorithm ...
Feb 15, 2011 · In this paper we present several relaxed inexact projection methods for the split feasibility problem (SFP). Each iteration of the first ...
Oct 22, 2024 · In this paper, we propose a ball-relaxed projection method for the SFP. Instead of half spaces, we replace C and Q in the proposed algorithm by ...
Zhongwen Wang, Qingzhi Yang, Yuning Yang: The relaxed inexact projection methods for the split feasibility problem. Appl. Math. Comput.
Jun 4, 2004 · In this paper, a modification of the CQ algorithm, called the relaxed CQ algorithm, is given, in which we replace PC and PQ by and , ...
We adopt flexible rules for selecting the stepsize and the projection region. The proposed algorithms are shown to be convergent under certain assumptions.
In this paper, we introduce a new projection method to solve the SFP and prove its convergence under standard assumptions. Our results improve previously known ...
In this paper, we investigate the split feasibility problem (SFP) and the split equality problem (SEP) in Hilbert spaces. Motivated by the technique of relaxed ...
Feb 18, 2020 · In this section, we propose and study a general separator-projection framework (Algorithm 1) for finding a point in a closed and convex subset ...
Missing: split | Show results with:split
In this paper we present several relaxed inexact projection methods for the split feasibility problem (SFP). Each iteration of the first proposed algorithm ...