Charles L. Byrne

Computational Theory and Mathematics · 2004–2011

A researcher in the Science corpus: 4 papers; trusts 28 researchers and is trusted by 15 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 28 citations into it
• Numerical Analysis — 22 citations into it
• Geometry and Topology — 14 citations into it
• Computational Mechanics — 10 citations into it
• Mathematical Physics — 9 citations into it; #873 of 8,562 by trust here, #3,664 by citations
• Civil and Structural Engineering — 7 citations into it
• Radiology, Nuclear Medicine and Imaging — 6 citations into it; #178 of 3,265 by trust here, #2,257 by citations

Whom Charles L. Byrne trusts overall

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

1. Yair Censor
2. Patrick L. Combettes
3. Heinz H. Bauschke
4. Ole W. Christensen
5. Tamer Basar
6. Jonathan Michael Borwein
7. Geoffrey J. McLachlan
8. Isao Yamada
9. Abdellatif Moudafi
10. Tomonari Suzuki

Who trusts Charles L. Byrne overall

1. Nicolas Loizou
2. Deanna Needell
3. Peter Richtárik
4. A. Wathen
5. Ahmed S. Hefny
6. Fan Wang
7. Joel A. Tropp
8. Tyrone Rees
9. Rachel A. Ward
10. Marwan Krunz

Papers from Charles L. Byrne's perspective

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

1. A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces (Mathematics of Operations Research)
2. Solving monotone inclusions via compositions of nonexpansive averaged operators
3. Parallel Optimization: Theory, Algorithms and Applications (Parallel Distributed Comput. Pract.)
4. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
5. The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings
6. The multiple-sets split feasibility problem and its applications for inverse problems
7. Monotone Operators and the Proximal Point Algorithm
8. A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
9. A unified approach for inversion problems in intensity-modulated radiation therapy (Physics in Medicine and Biology)
10. Dykstras algorithm with bregman projections: A convergence proof

Their papers

• The Split Common Null Point Problem (2011) — 278 citations
• Weak and Strong Convergence of Algorithms for the Split Common Null Point Problem (2011) — 151 citations
• Applied Iterative Methods (2007) — 348 citations
• Mathematics of Signal Processing (2004) — 58 citations