Computational Optimization Intern
Memorial Sloan Kettering Cancer Center, Department of Medical Physics
- IMRT radiotherapy planning reduces to a convex quadratic program with up to ~380K variables and ~570K constraints 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 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.
- Designed a combined ADMM variant (aggressive spectral penalty recovery plus safeguarded Anderson mixing) that roughly halves iterations to a usable warm start — up to ~4× from a mis-set penalty — and was the only method to reach the tight KKT tolerance on both cancer sites.
- Built a PDQP→interior-point hybrid reaching a ~100× tighter optimality gap than the production solver, plus a matrix-free warm-started conjugate-gradient GPU engine and a SLURM experiment harness with verified CPU/GPU parity.



