Operations Research
Continuous optimization and large-scale algorithms for linear, conic, and nonlinear programs.
Georgia Tech College of Engineering
H. Milton Stewart School of Industrial and Systems Engineering
PhD candidate in Operations Research at Georgia Tech ISyE.
I am advised by Professors Anton J. Kleywegt, Renato D.C. Monteiro, and Dmitrii M. Ostrovskii, and I work closely with Arkadi Nemirovski on theory, complexity analysis, and scalable optimization methods.
Research Group
Advisors and collaborators
I am advised by Anton J. Kleywegt, Renato D.C. Monteiro, and Dmitrii M. Ostrovskii at Georgia Tech ISyE. My recent work also involves collaborations with Arkadi Nemirovski, Diego Cifuentes, Vincent Guigues, Victor Hugo Nascimento, and Arnesh Sujanani.
Current submissions
Research Themes
Theory and complexity
I study the design and complexity of algorithms for linear programming, convex quadratic programming, semidefinite programming, complementarity problems, variational inequalities, and nonlinear convex programming.
Algorithms and software
I develop first-order methods and GPU-accelerated solvers for large-scale linear and semidefinite programming, using sparsity and low-rank structure to reduce computational cost.
Recent News
September 2026
On October 27, 2026, I will speak in the Georgia Tech ISyE Optimization Series, presenting joint work with my advisors on semidefinite programming (SDP) and entropy-smooth convex optimization.
September 2026
I will give two talks in the Georgia Tech ISyE Student Seminar Series: "A Low-Rank Augmented Lagrangian Frank-Wolfe-Based Method for SDPs with Unbounded Feasible Regions" on September 23, 2026, based on joint work with my advisor Renato D.C. Monteiro and Arnesh Sujanani; and "Entropy-Smooth Convex Optimization Cannot Be Accelerated" on October 14, 2026, based on joint work with my advisor Dmitrii M. Ostrovskii. Both talks will take place from 4:00–5:00 PM in George Tower 1102.
September 2026
At the 2026 INFORMS Annual Meeting in San Francisco, I will give two talks on Sunday, November 1: "Low-Rank SDP over Unbounded Domains via Hybrid Frank–Wolfe and Nonconvex Optimization" in the invited session "First-Order Methods for Semidefinite Programming" (8:00–9:15 AM), and "A Hybrid Sparse Augmented Lagrangian Method for Large-Scale Linear Programming" in the invited session "Recent Advances in Linear and Semidefinite Programming" (11:30–11:45 AM, Moscone South 215). I will also co-chair the latter session with my advisor Renato D.C. Monteiro.
September 2026
On October 16, I will present "A Sparse Augmented Lagrangian Method for Large-Scale Linear Programming" in the Georgia Tech ACO Student Seminar. The talk is based on joint work with my advisors Anton J. Kleywegt and Renato D.C. Monteiro.
July 2026
New arXiv preprint with Dmitrii M. Ostrovskii: "Entropy-Smooth Convex Optimization Cannot Be Accelerated."
March 2026
Presenting joint work called "Minimax D-Optimal Designs in Generalized Linear Models: Nonasymptotic Theory and Efficient Algorithms" with Dmitrii M. Ostrovskii in the ISyE PhD student Seminar on April 17th.
March 2026
Presenting joint work with Renato D.C. Monteiro in the ISyE PhD seminar on scalable semidefinite programming and inexact proximal point methods.
February 2026
Giving a talk in the Georgia Tech School of Mathematics Stochastics seminar series on April 9th on joint work with Dmitrii M. Ostrovskii.
February 2026
Awarded the Jessie and Ralph W. Pries Fellowship from the Georgia Tech College of Engineering.
September 2025
Looking forward to the SIAM Conference on Optimization 2026 and conversations on semidefinite and nonlinear programming.
September 2025
Hosting a session in the Linear and Conic Optimization track at the INFORMS Optimization Society 2026 meeting.