My research aims to develop general-purpose optimization algorithms that are optimal in theory and efficient in practice. I combine ideas from continuous and discrete mathematics to substantially advance state-of-the-art algorithms that tackle foundational problems in computer science and optimization, such as the maximum flow problem and linear programming. In the future, I plan to study linear algebraic data structures as another step forward in my ultimate quest to discover a universally efficient algorithm for solving convex optimization.
Fellow
![](https://www.packard.org/wp-content/uploads/2023/12/lee-yin-tat.jpg)