Computational Optimization Intern
Memorial Sloan Kettering Cancer Center, Department of Medical Physics
- IMRT radiotherapy planning reduces to a convex quadratic program with up to ~216K beamlet variables per clinical case. I work on making that solve fast: a path-following ADMM that warm-starts an interior-point method, GPU-accelerated with CuPy and mixed precision on V100 and P100 nodes.
- Implemented and benchmarked first-order methods from the recent literature — PDHG/PDQP (JAX/MPAX), ADMM with over-relaxation and adaptive penalties (residual-balancing, OSQP-style, spectral/ARADMM), Fast-ADMM with restart, and safeguarded Anderson acceleration — on real lung and prostate cases.
- Replaced the solver's hand-tuned settings with Bayesian optimization over 1,015 Optuna trials: 78 → 21 iterations to a usable warm start on a held-out clinical case — 3.7× fewer, 3.2–3.8× less wall-clock — then derived and validated a bound that explains the gain rather than just reporting it.
- Rebuilt the penalty recovery rule so runtime barely depends on a mis-set starting penalty — 6 → 21 iterations across four orders of magnitude, against 8 → 78 for the prior rule and 20 → 337 for the textbook one — on a platform behind ~1,100 solver runs: a matrix-free warm-started conjugate-gradient GPU engine, an NFS-safe SLURM search harness, and an early exit cutting trial cost 1.8–4.4×.



