Random projection with linear equalities and inequalities
Can inequalities be randomly compressed?
Jingye Xu · Optimization
Probability, Geometry,
Optimization.
Ph.D. candidate in Algorithms, Combinatorics and Optimization at Georgia Tech.
About
Structure beyond
convexity.
I am Jingye Xu, a Ph.D. candidate in Algorithms, Combinatorics and Optimization at Georgia Tech, advised by Santanu Dey and Diego Cifuentes. My research focuses on optimization, with particular interests in nonconvex duality and probabilistic methods.
More in my CV ↗Publications
Work.
All done before the LLM era (summer 2026). Now it’s time to embrace it.
Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
Why does decomposition work so well in practice?
Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
When does nonconvexity vanish at scale?
Lagrangian dual with zero duality gap that admits decomposition
Can strong duality coexist with decomposition?
Branching with a pre-specified finite list of k-sparse split sets for binary MILPs
How powerful can sparse branching be?
Sensitivity analysis for mixed binary quadratic programming
Can sensitivity analysis survive nonconvexity?
Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices
When is PSD-plus-diagonal decomposition tractable?
Selected Honors
Recognition.
2026
Alice and John Jarvis Best Student Paper Award
Awarded annually to one Ph.D. student in Georgia Tech ISyE across all disciplines.
2026
MIP Poster Award — Honorable Mention
2025
INFORMS Optimization Society Student Paper Prize — Honorable Mention
2024
INFORMS George Nicholson Student Paper Competition — Finalist
2024
Shabbir Ahmed PhD Fellowship
Awarded annually to one Ph.D. student in Georgia Tech ISyE in optimization.