Scott Lindstrom

Dr. Scott Lindstrom is a Lecturer at Curtin University's School of Electrical Engineering, Computing and Mathematical Sciences, within the Faculty of Science and Engineering. He holds an office in the Office of the Provost and is based at the Curtin Perth campus. His research focuses on advanced mathematical optimization, convex analysis, and algorithm design, with applications in numerical methods and feasibility problems.

Key research interests include error bounds in optimization, convex programming, and the Douglas-Rachford algorithm. He has contributed to theoretical developments in proximal algorithms, projection methods, and Bregman distances. Lindstrom's work often bridges pure and applied mathematics, addressing challenges in optimization theory and numerical analysis.

His publications span journals like Mathematical Programming and SIAM Journal on Optimization, with a focus on algorithmic innovation and rigorous mathematical analysis. Recent work includes studies on log-determinant cones, p-cones, and ADMM applications in signal processing. Lindstrom has also explored historical perspectives on mathematical practices and algorithmic evolution.

Notable contributions include developing centering methods for spiraling algorithms and advancing understanding of quasi relative interiors in convex programming. His interdisciplinary approach integrates optimization theory with practical computational techniques, addressing both theoretical and applied challenges.