Asymptotically tight Lagrangian dual of smooth nonconvex problems via smooth Shapley-Folkman Lemma
When does nonconvexity vanish at scale?
Jingye Xu · Optimization
Ph.D. candidate in Algorithms, Combinatorics and Optimization at Georgia Tech.
About
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 the mathematical foundations of optimization, with particular interests in duality theory for nonconvex optimization, probabilistic methods in optimization, and applications to reoptimization and distributed computing for nonconvex programs.
More in my CV ↗Publications
When does nonconvexity vanish at scale?
Can strong duality coexist with decomposition?
How powerful can sparse branching be?
Can sensitivity analysis survive nonconvexity?
When is PSD-plus-diagonal decomposition tractable?
Working Papers
Can inequalities be randomly compressed?
Why does decomposition work so well in practice?
Selected Honors
Awarded annually to one Ph.D. student in Georgia Tech ISyE across all disciplines.
Awarded annually to one Ph.D. student in Georgia Tech ISyE in optimization.