Scott B. Lindstrom
Computational Theory and Mathematics · 2018
A researcher in the Science corpus: 1 paper; trusts 17 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 14 citations into it; #8,493 of 12,182 by trust here, #11,946 by citations
- Numerical Analysis — 11 citations into it
- Computational Mechanics — 10 citations into it
- Geometry and Topology — 8 citations into it
- Mathematical Physics — 7 citations into it
- Computer Vision and Pattern Recognition — 5 citations into it
Whom Scott B. Lindstrom trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Heinz H. Bauschke
- R. Tyrrell Rockafellar
- Patrick L. Combettes
- Andrzej Cegielski
- Veit Elser
- Luis M. Briceño-Arias
- Pierre-Louis Lions
- Hung M. Phan
- Radu Ioan Bot
- Jonathan Michael Borwein
Who trusts Scott B. Lindstrom overall
Papers from Scott B. Lindstrom's perspective
Ordered by how strongly the researchers Scott B. Lindstrom trusts endorse each paper. Same corpus, a different order for every researcher.
- Monotone Operators and the Proximal Point Algorithm
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A new proximal point iteration that converges weakly but not in norm
- Phase retrieval by iterated projections. (Journal of The Optical Society of America A-optics Image Science and Vision)
- On the O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- The Split Bregman Method for L1-Regularized Problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Removing Multiplicative Noise by Douglas-Rachford Splitting Methods (Journal of Mathematical Imaging and Vision)
Their papers
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (2018) — 41 citations