Academic Jobs - Home of Higher Ed Logo

Rate My Professor Scott Lindstrom

Curtin University

#2,976 worldwide#2,870 in Australia

Ratings & reviews

5.08/20/2025

Encourages students to think critically.

4.05/21/2025

Always fair, kind, and deeply insightful.

5.03/31/2025

Brings real-world relevance to learning.

4.02/27/2025

Fosters collaboration and teamwork.

5.02/10/2025

Passionate about student development.

Taught by or worked with Scott?

Add your rating. It takes about 30 seconds.

About Scott

Dr. Scott Lindstrom is a Senior Lecturer in the School of Electrical Engineering, Computing and Mathematical Sciences at Curtin University, within the Faculty of Science and Engineering. He serves as Discipline Lead for Mathematics and is affiliated with the Centre for Optimisation and Decision Science. Lindstrom earned his PhD in Mathematics from the University of Newcastle in 2018, following a Master's degree from Portland State University in 2015 and a Bachelor's degree in Psychology. Prior to joining Curtin University in 2021, he held a postdoctoral position in the Department of Applied Mathematics at the Hong Kong Polytechnic University from 2018 to 2021. His research employs variational analysis and computational tools to investigate nonlinear optimisation problems from a geometric viewpoint, encompassing error bounds without constraint qualifications, projection methods such as Douglas-Rachford and ADMM, conic feasibility, and applications to machine learning, data science, engineering, audio signal recovery, and wavelet problems. Notable publications include 'Optimal Error Bounds in the Absence of Constraint Qualifications with Applications to p-Cones and Beyond' (2024), 'Generalized Power Cones: Optimal Error Bounds and Automorphisms' (2024), 'Tight Error Bounds for Log-Determinant Cones Without Constraint Qualifications' (2025), 'The ADMM Algorithm for Audio Signal Recovery and Performance Modification with the Dual Douglas-Rachford Dynamical System' (2024), and 'Quadratic Convergence of a Projection Method for a Plane Curve Feasibility Problem' (2025). His work has garnered over 300 citations on Google Scholar.