The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
By Yazheng Dang, Yan Gao. 2010
138 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/6ed003d12aae497a3593655345a22821ec47314e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Aviv Gibali
- Simeon Reich
- Yair Censor
- Dang Van Hieu
- Duong Viet Thong
- Yekini Shehu
- Satit Saejung
- Rapeepan Kraikaew
In Geometry and Topology
In Numerical Analysis
- Aviv Gibali
- Simeon Reich
- Yair Censor
- Dang Van Hieu
- Duong Viet Thong
- Yekini Shehu
- Oluwatosin Temitope Mewomo
- Satit Saejung
Citations in the corpus
- 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].”