Numerical optimization
First-order and operator splitting methods for linear, quadratic, and convex optimization.
Applied mathematician · Hong Kong
I design algorithms and GPU implementations for large-scale linear and quadratic programming, connecting rigorous optimization theory with high-performance scientific computing.
01 Theory, implementation, and numerical experiments
01 / Research
My doctoral research focuses on scalable algorithms for large optimization models, with an emphasis on operator splitting methods and modern GPU architectures.
First-order and operator splitting methods for linear, quadratic, and convex optimization.
High-throughput implementations designed for large sparse instances and stringent tolerances.
Open software and careful benchmarking that connect theoretical advances to practical performance.
02 / Publications
Linear and quadratic programming, splitting methods, and certified robustness.
03 / Software
Open-source Julia and CUDA implementations for large-scale optimization experiments.
A GPU solver for large-scale linear programs, pairing a Halpern–Peaceman–Rachford method with adaptive restart and penalty parameter updates.
A dual HPR framework for large-scale convex composite quadratic programming, designed around efficient range-space updates and GPU scalability.
04 / Background
The Hong Kong Polytechnic University
Department of Applied MathematicsHunan University
School of MathematicsLP · QP · operator splitting · sparse linear algebra · GPU computing