On the Mann-type iteration and the convex feasibility problem

By Ştefan Mruşter, Cristina Popîrlan. 2008

69 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/37364af037021773c6dd7abce9d84a3948fe72ae

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

1. Yeong-Cheng Liou
2. Yonghong Yao
3. Mihai Postolache
4. Jing Zhao
5. Muhammad Aslam Noor

In Geometry and Topology

1. Yeong-Cheng Liou
2. Yonghong Yao
3. Mihai Postolache
4. Jing Zhao

In Numerical Analysis

1. Yeong-Cheng Liou
2. Yonghong Yao
3. Mihai Postolache
4. Jing Zhao
5. Muhammad Aslam Noor

Citations in the corpus

• Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms (2015, background): “Furthermore, F N is well known to include resolvents and projection operators, while F Q contains subgradient projection operators (see, for instance, [21], and the reference therein).”
• Self-adaptive algorithms for the split problem of the demicontractive operators (2018, background): “[2,3], Măruşter and Popîrlan [4], Qin and Yao [5], Sahu and Yao [6], Tang et al.”