Mathematical optimization · Clemson University
Structure, geometry, and algorithms for hard optimization problems
I am an Assistant Professor in the School of Mathematical and Statistical Sciences at Clemson University. My research develops semidefinite programming methods for combinatorial optimization, with particular emphasis on facial reduction, efficient relaxations, and reliable computation.
Research focus
Optimization that respects problem structure
My work connects the geometry of conic optimization with algorithms for difficult discrete problems. The goal is not only to obtain strong bounds, but to make the resulting models smaller, more stable, and more useful in computation.
01
Semidefinite programming
Convex relaxations that reveal structure in quadratic and combinatorial optimization problems.
02
Facial reduction
Geometric preprocessing for degeneracy, strict feasibility, singularity degree, and exact duality.
03
Scalable algorithms
Splitting and first-order methods for large semidefinite and doubly nonnegative relaxations.
Academic path
From discrete models to conic geometry
2021—present
Clemson University
Assistant Professor, Mathematical and Statistical Sciences
2019—2021
University of Waterloo
Postdoctoral researcher with Henry Wolkowicz
2019
Tilburg University
PhD in Mathematical Programming and Operations Research, supervised by Renata Sotirov
Contact
Let’s talk optimization.
For research questions, collaborations, and student inquiries, the best way to reach me is by email.
Martin Hall O327
Clemson, South Carolina