Isao Yamada
Computational Theory and Mathematics · 2001–2014
A researcher in the Science corpus: 11 papers; trusts 29 researchers and is trusted by 71 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 38 citations into it; #407 of 12,489 by trust here, #999 by citations
- Computational Mechanics — 33 citations into it; #887 of 10,021 by trust here, #1,515 by citations
- Numerical Analysis — 32 citations into it; #140 of 3,703 by trust here, #230 by citations
- Artificial Intelligence — 15 citations into it
- Signal Processing — 14 citations into it; #5,259 of 7,592 by trust here, #6,603 by citations
- Applied Mathematics — 12 citations into it; #2,175 of 7,714 by trust here, #3,325 by citations
- Mathematical Physics — 12 citations into it; #2,525 of 8,596 by trust here, #3,685 by citations
- Computer Vision and Pattern Recognition — 11 citations into it; #7,815 of 21,973 by trust here, #10,433 by citations
Whom Isao Yamada trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Heinz H. Bauschke
- Nobuhiko Ogura
- Patrick L. Combettes
- Jonathan Michael Borwein
- Jacob Benesty
- P. S. Ramirez
- Ivar Ekeland
- Cássio Guimarães Lopes
- Ali H. Sayed
- Federico S. Cattivelli
Who trusts Isao Yamada overall
- Nobuhiko Ogura
- Andrzej Cegielski
- Rafał Zalas
- Aviv Gibali
- Paul-Emile Maingé
- Heinz H. Bauschke
- Ali H. Sayed
- Simeon Reich
- Lu-Chuan Ceng
- Hideaki Iiduka
Papers from Isao Yamada's perspective
Ordered by how strongly the researchers Isao Yamada trusts endorse each paper. Same corpus, a different order for every researcher.
- The foundations of set theoretic estimation
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
- The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces (Mathematics of Operations Research)
- Fundamentals of Adaptive Filtering
- Convex analysis and minimization algorithms
- Monotone Operators and the Proximal Point Algorithm
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
Their papers
- Tensor completion and low-n-rank tensor recovery via convex optimization (2011) — 838 citations
- The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings (2001) — 747 citations
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings (2005) — 296 citations
- Compositions and convex combinations of averaged nonexpansive operators (2014) — 114 citations
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING (2002) — 79 citations
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications (2009) — 108 citations
- Adaptive Learning in a World of Projections (2011) — 233 citations
- Diffusion Least-Mean Squares With Adaptive Combiners: Formulation and Performance Analysis (2010) — 297 citations
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings (2006) — 90 citations
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions (2005) — 195 citations
- A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems (2002) — 84 citations