Yair Censor

Computational Theory and Mathematics · 2005–2012

A researcher in the Science corpus: 11 papers; trusts 20 researchers and is trusted by 36 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 61 citations into it; #508 of 12,182 by trust here, #430 by citations
• Numerical Analysis — 52 citations into it; #150 of 3,586 by trust here, #88 by citations
• Geometry and Topology — 26 citations into it
• Computational Mechanics — 17 citations into it; #2,689 of 10,001 by trust here, #3,559 by citations
• Civil and Structural Engineering — 11 citations into it; #359 of 6,160 by trust here, #1,103 by citations
• Mathematical Optimization — 10 citations into it
• Mathematical Physics — 10 citations into it; #4,656 of 8,562 by trust here, #2,478 by citations
• Applied Mathematics — 8 citations into it; #2,801 of 7,620 by trust here, #2,295 by citations

Whom Yair Censor trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Heinz H. Bauschke
2. Alfredo Noel Iusem
3. Muhammad Aslam Noor
4. Hong-Kun Xu
5. Isao Yamada
6. Wataru Takahashi
7. Aviv Gibali
8. Patrick L. Combettes
9. Qingzhi Yang
10. Simeon Reich

Who trusts Yair Censor overall

1. Duong Viet Thong
2. Charles L. Byrne
3. Aviv Gibali
4. Rapeepan Kraikaew
5. Dang Van Hieu
6. Yekini Shehu
7. Abdellatif Moudafi
8. Simeon Reich
9. Satit Saejung
10. Lateef Olakunle Jolaoso

Papers from Yair Censor's perspective

Ordered by how strongly the researchers Yair Censor trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings
2. Forcing strong convergence of proximal point iterations in a Hilbert space (Mathematical programming)
3. A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces (Mathematics of Operations Research)
4. Construction of best Bregman approximations in reflexive Banach spaces
5. Parallel Optimization: Theory, Algorithms and Applications (Parallel Distributed Comput. Pract.)
6. APPROXIMATION OF SOLUTIONS OF VARIATIONAL INEQUALITIES FOR MONOTONE MAPPINGS
7. Monotone Operators and the Proximal Point Algorithm
8. Solving monotone inclusions via compositions of nonexpansive averaged operators
9. The extragradient method for finding saddle points and other problems
10. On Projection Algorithms for Solving Convex Feasibility Problems

Their papers

• Algorithms for the Split Variational Inequality Problem (2010) — 707 citations
• The Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space (2011) — 926 citations
• The multiple-sets split feasibility problem and its applications for inverse problems (2005) — 802 citations
• The Split Common Null Point Problem (2011) — 278 citations
• Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space (2012) — 439 citations
• Common Solutions to Variational Inequalities (2012) — 103 citations
• Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space (2011) — 448 citations
• Weak and Strong Convergence of Algorithms for the Split Common Null Point Problem (2011) — 151 citations
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem (2007) — 268 citations
• A unified approach for inversion problems in intensity-modulated radiation therapy (2006) — 904 citations
• BEST APPROXIMATION TO COMMON FIXED POINTS OF A SEMIGROUP OF NONEXPANSIVE OPERATORS (2005) — 55 citations