Giang-Tran, K.-H., Ho-Nguyen, N., & Lee, D. (2025). A projection-free method for solving convex bilevel optimization problems.
Mathematical Programming,
213(1), 907–940.
https://doi.org/10.1007/s10107-024-02157-1
Giang-Tran, K.-H., Shafiee, S., & Ho-Nguyen, N. (2025). Conditional gradient methods with standard
LMO for stochastic simple bilevel optimization.
The Thirty-Ninth Annual Conference on Neural Information Processing Systems.
https://openreview.net/forum?id=AJAEHgM8lc
Ho-Nguyen, N. (2025). Online convex optimization. In P. M. Pardalos & O. A. Prokopyev (Eds.),
Encyclopedia of optimization (pp. 1–4). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-030-54621-2_871-1
Gutman, D. H., & Ho-Nguyen, N. (2023). Coordinate descent without coordinates: Tangent subspace descent on
Riemannian manifolds.
Mathematics of Operations Research,
48(1), 127–159.
https://doi.org/10.1287/moor.2022.1253
Ho-Nguyen, N., Kılınç-Karzan, F., Küçükyavuz, S., & Lee, D. (2023). Strong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under
Wasserstein ambiguity.
INFORMS Journal on Optimization,
5(2), 211–232.
https://doi.org/10.1287/ijoo.2022.0083
Ho-Nguyen, N., & Wright, S. J. (2023). Adversarial classification via distributional robustness with
Wasserstein ambiguity.
Mathematical Programming,
198(2), 1411–1447.
https://doi.org/10.1007/s10107-022-01796-6
Shen, L., Ho-Nguyen, N., & Kılınç-Karzan, F. (2023). An online convex optimization-based framework for convex bilevel optimization.
Mathematical Programming,
198(2), 1519–1582.
https://doi.org/10.1007/s10107-022-01894-5
Benadè, G., Ho-Nguyen, N., & Hooker, J. N. (2022). Political districting without geography.
Operations Research Perspectives,
9.
https://doi.org/10.1016/j.orp.2022.100227
Gutman, D. H., & Ho-Nguyen, N. (2022). Cyclic coordinate descent in the
Hölder smooth setting.
Operations Research Letters,
50(5), 458–462.
https://doi.org/10.1016/j.orl.2022.06.002
Ho-Nguyen, N., & Kılınç-Karzan, F. (2022). Risk guarantees for end-to-end prediction and optimization processes.
Management Science,
68(12), 8680–8698.
https://doi.org/10.1287/mnsc.2022.4321
Ho-Nguyen, N., Kılınç-Karzan, F., Küçükyavuz, S., & Lee, D. (2022). Distributionally robust chance-constrained programs with right-hand side uncertainty under
Wasserstein ambiguity.
Mathematical Programming,
196(1-2), 641–672.
https://doi.org/10.1007/s10107-020-01605-y
Ho-Nguyen, N., & Kılınç-Karzan, F. (2021). Technical note—dynamic data-driven estimation of nonparametric choice models.
Operations Research,
69(4), 1228–1239.
https://doi.org/10.1287/opre.2020.2077
Ho-Nguyen, N., & Kılınç-Karzan, F. (2019). Exploiting problem structure in optimization under uncertainty via online convex optimization.
Mathematical Programming,
177(1-2), 113–147.
https://doi.org/10.1007/s10107-018-1262-8
Ho-Nguyen, N., & Kılınç-Karzan, F. (2018a). Online first-order framework for robust convex optimization.
Operations Research,
66(6), 1670–1692.
https://doi.org/10.1287/opre.2018.1764
Ho-Nguyen, N., & Kılınç-Karzan, F. (2018b). Primal–dual algorithms for convex optimization via regret minimization.
IEEE Control Systems Letters,
2(2), 284–289.
https://doi.org/10.1109/LCSYS.2018.2831721
Ho-Nguyen, N., & Kılınç-Karzan, F. (2017). A second-order cone based approach for solving the trust-region subproblem and its variants.
SIAM Journal on Optimization,
27(3), 1485–1512.
https://doi.org/10.1137/16M1065197