Applied mathematician · Hong Kong

Optimization methods
built for scale.

I design algorithms and GPU implementations for large-scale linear and quadratic programming, connecting rigorous optimization theory with high-performance scientific computing.

Optimization landscape Nested contours converge toward a solution point over a computational grid. min f(x) s.t. Ax = b x*

01 Theory, implementation, and numerical experiments

01 / Research

From convergence theory to computational scale.

My doctoral research focuses on scalable algorithms for large optimization models, with an emphasis on operator splitting methods and modern GPU architectures.

01

Numerical optimization

First-order and operator splitting methods for linear, quadratic, and convex optimization.

02

GPU computing

High-throughput implementations designed for large sparse instances and stringent tolerances.

03

Scalable solvers

Open software and careful benchmarking that connect theoretical advances to practical performance.

02 / Publications

Selected work

Linear and quadratic programming, splitting methods, and certified robustness.

  1. 2026
    Journal articleMathematical Programming Computation 18

    HPR-LP: An implementation of an HPR method for solving linear programming

    Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao

  2. 2025
    PreprintarXiv:2509.23903

    On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming

    Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao

  3. 2025
    PreprintarXiv:2507.02470

    HPR-QP: A dual Halpern–Peaceman–Rachford method for solving large-scale convex composite quadratic programming

    Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao

  4. 2025
    PreprintarXiv:2501.07807

    Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems

    Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao

  5. 2024
    ConferenceICML 2024 · PMLR 235

    Collective Certified Robustness against Graph Injection Attacks

    Yuni Lai, Bailin Pan, Kaihuang Chen, Yancheng Yuan, Kai Zhou

03 / Software

Research, made executable.

Open-source Julia and CUDA implementations for large-scale optimization experiments.

Linear programmingJulia · GPU

HPR-LP

A GPU solver for large-scale linear programs, pairing a Halpern–Peaceman–Rachford method with adaptive restart and penalty parameter updates.

  • Large sparse LP instances
  • Large-scale benchmark suite
  • High-accuracy numerical experiments
View repository
Quadratic programmingJulia · CUDA

HPR-QP

A dual HPR framework for large-scale convex composite quadratic programming, designed around efficient range-space updates and GPU scalability.

  • Restricted Wolfe dual formulation
  • Adaptive practical enhancements
  • Scalable sparse computation
View repository

04 / Background

Mathematics with a computational point of view.

2020—2026

Ph.D. in Applied Mathematics

The Hong Kong Polytechnic University

Department of Applied Mathematics
2016—2020

B.Sc. in Information and Computing Science

Hunan University

School of Mathematics

Methods & domains

LP · QP · operator splitting · sparse linear algebra · GPU computing