“Parameter-Free Schemes for Smooth Stochastic Optimization: Adaptation and Acceleration.” Job Market Showcase, INFORMS Annual Meeting, San Francisco, November 2026.
“A Stochastic LineseArch Method (SLAM) and an Accelerated Extension.” MOPTA, Bethlehem, August 2026.
“A Stochastic LineseArch Method (SLAM) for Minimizing Expectation Residuals.” INFORMS Optimization Society Conference, Atlanta, March 2026.
“A Stochastic LineseArch Method (SLAM) for Minimizing Expectation Residuals.” INFORMS Annual Meeting, Atlanta, October 2025.
“A Stochastic Line Search Method for Minimizing Expectation Residuals.” EURO OSS on Operational Research and Machine Learning, online, October 2025.
“A Stochastic LineseArch Method (SLAM) for Minimizing Expectation Residuals.” International Conference on Continuous Optimization, Los Angeles, July 2025.
“Stochastic Nonlinear Constrained Optimization.” INFORMS Annual Meeting, Seattle, October 2024.
“Stochastic Constrained Optimization.” Cornell ORIE Young Researchers Workshop, Ithaca, October 2024. Poster.
“Minimal Variance Batch Sampling for Unconstrained Nonlinear Optimization.” Summer Argonne Student Symposium, Argonne, August 2024.
“A Stochastic Interior-Point Method for Inequality-Constrained Optimization.” YinzOR, Pittsburgh, August 2024.
“Stochastic Nonlinear Constrained Optimization.” MOPTA, Bethlehem, August 2024.
“A Stochastic Interior-Point Method for Inequality-Constrained Optimization.” International Symposium on Mathematical Programming, Montréal, July 2024.
“Almost-Sure Convergence of Iterates and Multipliers in Stochastic Sequential Quadratic Optimization.” INFORMS Optimization Society Conference, Houston, March 2024.
“A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems.” INFORMS Annual Meeting, Phoenix, October 2023.
“A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems.” MOPTA, Bethlehem, August 2023.
“A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems.” SIAM Conference on Optimization, Seattle, June 2023.
“Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization.” INFORMS Annual Meeting, Indianapolis, October 2022.
“Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization.” International Conference on Continuous Optimization, Bethlehem, July 2022.