• Most of my works are available as preprints or open access. If the item you would like is not one of them, please do not hesitate to e-mail me for a copy.

• All of my authored items follow the mathematical tradition of authors appearing in alphabetical order; corresponding author also has no significance and so is not indicated. 

• Flag emojis indicate (respectively) the affiliations of the authors. Note that they may not show up correctly on all browsers.

RECENT PREPRINTS

Works that have been submitted to journals and are awaiting peer review. In top mathematics journals, the review process typically takes between 1 and 3 years.

1. Andrew Calcan, Jordan Collard, Alberto De Marchi, and Scott B. Lindstrom, Resolvent Moreau identities without monotonicity: theory and applications to Gabay duality, Douglas–Rachford and ADMM (2026). 🇦🇺🇦🇺🇩🇪🇦🇺 preprint

JOURNAL PUBLICATIONS

Works published or accepted in peer reviewed journals (ordered newest to oldest)

1. Jordan Collard and Scott B. Lindstrom, "Quadratic Convergence of a Projection Method for a Plane Curve Feasibility Problem," MATRIX Annals 2025, in press (2025). preprint 

2. Ying Lin, Scott B. Lindstrom, Bruno F. Lourenço, and Ting Kei Pong, "Tight error bounds for log-determinant cones without constraint qualifications," Journal of Optimization Theory and Applications, in press (2025). 🇭🇰🇦🇺🇯🇵🇭🇰 preprint

3. Ying Lin, Scott B. Lindstrom, Bruno F. Lourenço, and Ting Kei Pong, "Generalized power cones: optimal error bounds and automorphisms," SIAM J. Optimization, in press (2024).  🇭🇰🇦🇺🇯🇵🇭🇰
   preprint

4. Scott B. Lindstrom, Bruno F. Lourenço, and Ting Kei Pong, "Optimal error bounds in the absence of constraint qualifications with applications to the p-cones and beyond," Mathematics of Operations Research, in press (2024).  🇦🇺🇯🇵🇭🇰
   preprint

5. Andrew Calcan and Scott B. Lindstrom, "The ADMM algorithm for audio signal recovery and performance modification with the dual Douglas–Rachford dynamical system," AIMS Mathematics, (2024) 9(6) 14640–14657 . 🇦🇺🇦🇺  
   open access version code

6. Scott B. Lindstrom, Bruno F. Lourenço, and Ting Kei Pong, ``Error bounds, facial residual functions and applications to the exponential cone,'' Mathematical Programming, (2022) 200, 229–278. 🇭🇰🇭🇰🇯🇵  
   open access version preprint

7. Scott B. Lindstrom, "Computable Centering Methods for Spiraling Algorithms and their Duals, with Motivations from the Theory of Lyapunov Functions," Computational Optimization and Applications, (2022) 83, 999–1026. 🇭🇰
   open access version preprint code

8. Neil Dizon, Jeffrey Hogan, and Scott B. Lindstrom "Circumcentering Reflection Methods for Nonconvex Feasibility Problems," Set-Valued and Variational Analysis, (2022) 30, 943–973. 🇫🇮🇦🇺🇭🇰  
   open access version preprint code

9. Scott B. Lindstrom, ``The Projected Polar Proximal Point Algorithm Converges Globally,'' Journal of Global Optimization, (2022), 84, 177–203. 🇭🇰
   open access version preprint

10. Neil Dizon, Jeffrey Hogan, and Scott B. Lindstrom, "Circumcentered Reflections Method for Wavelet Feasibility Problems," ANZIAM, (2022) 62. 🇫🇮🇦🇺🇭🇰  
    open access version

11. Regina S. Burachik, Minh N. Dao, and Scott B. Lindstrom, ``Generalized Bregman envelopes and proximity operators,'' Journal of Optimization theory and Applications, (2021), 190(3), 744-778. 🇦🇺🇦🇺🇭🇰   
    preprint code

12. Regina S. Burachik, Minh N. Dao, and Scott B. Lindstrom, "The Generalized Bregman Distance," SIAM Journal on Optimization, (2021), 31(1), 404-424. 🇦🇺🇦🇺🇭🇰
    preprint

13. Scott B. Lindstrom and Brailey Sims, “Survey: Sixty Years of Douglas-Rachford.” J. AustMS, (2021) 110(3), 333-370. 🇦🇺🇦🇺
    preprint

14. Heinz H. Bauschke and Scott B. Lindstrom, “Proximal Averages for Minimization of Entropy Functionals,” Pure and Applied Functional Analysis, (2020) 5(3), 505-531. 🇨🇦🇦🇺  
    preprint plots code entropy code

15. Scott B. Lindstrom, ``A Note on Cores and Quasi Relative Interiors in Partially Finite Convex Programming,'' Journal of Convex Analysis, (2022) 29(1) 129--142. 🇭🇰
    preprint code

16. Heinz H. Bauschke, Minh N. Dao, and Scott B. Lindstrom, “The Douglas-Rachford algorithm for a Hyperplane and a Doubleton." Global Optimization, (2019) 74(1), 79-93. 🇨🇦🇦🇺🇦🇺
    preprint

17. Scott B. Lindstrom and Paul Vrbik, "Phase Portraits of Hyperbolic Geometry." Mathematical Intelligencer, (2019) 41(3), 1-9. 🇦🇺🇨🇦
    preprint code

18. Bishnu P. Lamichhane, Scott B. Lindstrom, and Brailey Sims, "Application of Projection Algorithms to Differential Equations: Boundary Value Problems," ANZIAM, (2019) 61(1), 23-46. 🇦🇺🇦🇺🇦🇺
    preprint code

19. Hoa T. Bui, Scott B. Lindstrom, and Vera Roshchina, "VADU 2018 Open Problem Session." Journal of Optimization Theory and Applications, (2019) 182(1), 430-437. 🇦🇺🇦🇺🇦🇺
    preprint

20. Heinz H. Bauschke, Minh N. Dao, and Scott B. Lindstrom, "Regularizing with Bregman-Moreau Envelopes," SIAM Journal on Optimization,  (2018) 28(4), 3208-3228. 🇨🇦🇦🇺🇦🇺
    preprint plots code entropy code

21. Jonathan M. Borwein, Scott B. Lindstrom, Brailey Sims, Matthew P. Skerritt, and Anna Schneider, "Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres." Set Valued and Variational Analysis, (2018) 26(2), 385-403. 🇦🇺🇦🇺🇦🇺🇦🇺🇩🇪  
    preprint

22. Jonathan M. Borwein and Scott B. Lindstrom, “Meetings With Lambert W and Other Special Functions in Optimization and Analysis.”  Pure and Applied Functional Analysis, (2017) 1(3), p.361. 🇦🇺🇦🇺
    open access version preprint code

23. Scott B. Lindstrom, Brailey Sims, and Matthew P. Skerritt, "Computing Intersections of Implicitly Specified Plane Curves." Journal of Nonlinear and Convex Analysis, (2017) 18(3), 347-359. 🇦🇺🇦🇺🇦🇺
    on CARMA

24. Jonathan M. Borwein, Neil J. Calkin, Scott B. Lindstrom, and Andrew Mattingly, "Continued Logarithms and Associated Continued Fractions," Journal of Experimental Mathematics, (2016) 26(4), 412-429. 🇦🇺🇺🇸🇦🇺🇦🇺
    open access version preprint 

PROCEEDINGS PUBLICATIONS

Works published or accepted in peer reviewed conference proceedings

1. Reinier Diaz-Millan, Scott B. Lindstrom, and Vera Roshchina, “Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples,” in From Analysis to Visualization: A Celebration of the Life and Legacy of Jonathan M. Borwein, Callaghan, Australia, September 2017, (2020) in series Springer Proceedings in Mathematics and Statistics. 🇧🇷🇦🇺🇦🇺  
   preprint

2. Neil Dizon, Jeffrey Hogan, and Scott B. Lindstrom, “Centering Projection Methods for Wavelet Feasibility Problems,” to appear in ISAAC 2019: The 30th International Symposium on Algorithms and Computation proceeding volume Current Trends in Analysis, its Applications and Computation, P. Cerejeiras, M. Reissig, I. Sabadini, J. Toft (Editors), in series Birkhäuser series Research Perspectives. arXiv:2005.05687 (2020). 🇫🇮🇦🇺🇭🇰
   preprint

BOOK CHAPTERS

1. Lindstrom, S.B. (2026). "Introduction to Experimental Mathematics." In: Sriraman, B. (eds) Handbook of Visual, Experimental and Computational Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-93954-0_72-1 Springer Link

2. Scott B. Lindstrom, "The Art of Modern Homo Habilis Mathematicus, or: What Would Jon Borwein Do?", (2020) In: Sriraman B. (eds) Handbook of the Mathematics of the Arts and Sciences. Springer, Cham. 🇭🇰
   code

PHD DISSERTATION

• Scott B. Lindstrom, "Proximal point algorithms, dynamical systems, and associated operators: modern perspectives from experimental mathematics," (2019). 🇦🇺
  at NOVA

EDITORIAL

• I edited the section on Experimental Mathematics for Sriraman, B. (Ed.). (2026). Handbook of visual, experimental and computational mathematics: Bridges through data. Springer. https://doi.org/10.1007/978-3-032-16368-4 🌏
  eBook 

REPORTS

• (as chair) Annual report of the Australian Mathematical Society Student Support Committee, 2024. The committee allocated more than $30k AUD in grants for students to attend 2 conferences.

• Workshop Report: Splitting Algorithms, Advances, Challenges, and Opportunities, 2025. Prepared for MATRIX Institute, MATRIX-Simons Collaborative Fund, Australian Mathematical Society, Australian Mathematical Sciences Institute, and the Mathematics of Computation and Optimisation special interest group of Australian Mathematical Society.