Andrzej Cegielski

Computational Theory and Mathematics · 2012–2013

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

Subfields

• Computational Theory and Mathematics — 22 citations into it; #2,206 of 12,182 by trust here, #5,724 by citations
• Numerical Analysis — 20 citations into it; #687 of 3,586 by trust here, #1,559 by citations
• Geometry and Topology — 15 citations into it; #1,507 of 7,422 by trust here, #3,077 by citations
• Computational Mechanics — 8 citations into it
• Applied Mathematics — 5 citations into it
• Mathematical Physics — 5 citations into it

Whom Andrzej Cegielski trusts overall

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

1. Isao Yamada
2. Nobuhiko Ogura
3. Sever A. Hirstoaga
4. Hong-Kun Xu
5. Qingzhi Yang
6. Heinz H. Bauschke
7. R. Tyrrell Rockafellar
8. Philip Wolfe
9. Hein Hundal
10. Paul-Emile Maingé

Who trusts Andrzej Cegielski overall

1. Scott B. Lindstrom
2. Patrick L. Combettes
3. Aviv Gibali
4. Yekini Shehu
5. Isao Yamada
6. Brailey Sims
7. Simeon Reich
8. Prasit Cholamjiak
9. Rafał Zalas
10. Qiao-Li Dong

Papers from Andrzej Cegielski's perspective

Ordered by how strongly the researchers Andrzej Cegielski 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. Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
3. A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems
4. On Projection Algorithms for Solving Convex Feasibility Problems
5. A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces (Mathematics of Operations Research)
6. Iterative selection methods for common fixed point problems
7. The foundations of set theoretic estimation
8. Convex analysis and minimization algorithms
9. NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
10. Fundamentals of Adaptive Filtering

Their papers

• Iterative Methods for Fixed Point Problems in Hilbert Spaces (2012) — 439 citations
• Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators (2013) — 49 citations