Yazheng Dang
Computational Theory and Mathematics · 2010
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 8 citations into it
- Numerical Analysis — 8 citations into it
Whom Yazheng Dang trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Yazheng Dang overall
Papers from Yazheng Dang's perspective
Ordered by how strongly the researchers Yazheng Dang trusts endorse each paper. Same corpus, a different order for every researcher.
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- The relaxed CQ algorithm solving the split feasibility problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Several solution methods for the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Parallel Optimization: Theory, Algorithms and Applications (Parallel Distributed Comput. Pract.)
- Forcing strong convergence of proximal point iterations in a Hilbert space (Mathematical programming)
- Further Results for Perron-Frobenius Theorem for Nonnegative Tensors (SIAM Journal on Matrix Analysis and Applications)
- A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
Their papers
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem (2010) — 138 citations