Several solution methods for the split feasibility problem

By Jinling Zhao, Qingzhi Yang. 2005

181 citations recorded by the source corpus.

Subfields: Computational Mechanics, Computational Theory and Mathematics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/683fc2bbe42446d904f7e3430a7d2b4d82ac193d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

1. Aviv Gibali
2. Alexander Segal
3. Yair Censor
4. Simeon Reich
5. Avi Motova
6. Yazheng Dang
7. Tal Schuster
8. Alfred K. Louis

In Computational Theory and Mathematics

1. Aviv Gibali
2. Simeon Reich
3. Yair Censor
4. Frank Schöpfer
5. Tal Schuster
6. Alfred K. Louis
7. Dang Van Hieu
8. Yazheng Dang

In Numerical Analysis

1. Aviv Gibali
2. Simeon Reich
3. Yair Censor
4. Tal Schuster
5. Frank Schöpfer
6. Alfred K. Louis
7. Dang Van Hieu
8. Yazheng Dang

Citations in the corpus

• An iterative regularization method for the solution of the split feasibility problem in Banach spaces (2008, methodology): “Some results in this direction were given by Eicke [27], who analyzed the regularizing properties of the projected Landweber method in Hilbert spaces with respect to perturbed right hand side {y}, or Zhao and Yang [49], who studied a relaxed version of the CQ algorithm for the use of approximately g”
• Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations (2017, unknown): “The reader can refer to: Byrne [2], Ceng et al. [3, 4], Censor et al. [5–7], He et al. [10, 11], Qu and Xiu [15], Xu [17, 18], Yang [19], Yao et al. [21, 23, 26], Zhao [30], and the references therein.”
• Algorithms for the Split Variational Inequality Problem (2010, background): “More work on the SCFP can be found in [6, 15, 27, 34, 38, 40, 43, 44, 46, 48, 49].”
• The multiple-sets split feasibility problem and its applications for inverse problems (2005, unknown): “Related to the two-sets split feasibility problem are also the recent papers of Zhao and Yang [37] and Qu and Xiu [30].”
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem (2010, methodology): “Various algorithms have been invented to solve the SFP, see [1, 2, 4, 7, 10, 14, 15] and references therein.”
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem (2007, methodology): “Zhao and Yang in [31] developed a perturbed projections method for the SFP based on the CQ-algorithm.”