The relaxed CQ algorithm solving the split feasibility problem
By Qingzhi Yang. 2004
327 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/a6427a95ada625e1146716742f4da86be999114c
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
In Computational Theory and Mathematics
- Yonghong Yao
- Yeong-Cheng Liou
- Yair Censor
- Jen-Chih Yao
- Yazheng Dang
- Yan Gao
- Thomas Bortfeld
- Dang Van Hieu
In Numerical Analysis
- Yonghong Yao
- Yeong-Cheng Liou
- Yair Censor
- Yazheng Dang
- Yan Gao
- Jen-Chih Yao
- Dang Van Hieu
- Charles L. Byrne
Citations in the corpus
- A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces (2014, unknown): “Q. Yang (2004).”
- 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.”
- Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations (2017, background): “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.”