default search action
Nam Ho-Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Lingqing Shen, Nam Ho-Nguyen, Khanh-Hung Giang-Tran, Fatma Kilinç-Karzan:
Mistake, Manipulation and Margin Guarantees in Online Strategic Classification. CoRR abs/2403.18176 (2024) - 2023
- [j12]Nam Ho-Nguyen
, Fatma Kilinç-Karzan
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity. INFORMS J. Optim. 5(2): 211-232 (2023) - [j11]David H. Gutman
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds. Math. Oper. Res. 48(1): 127-159 (2023) - [j10]Nam Ho-Nguyen
Adversarial classification via distributional robustness with Wasserstein ambiguity. Math. Program. 198(2): 1411-1447 (2023) - [j9]Lingqing Shen
An online convex optimization-based framework for convex bilevel optimization. Math. Program. 198(2): 1519-1582 (2023) - [i3]Duksang Lee, Nam Ho-Nguyen, Dabeen Lee:
Projection-Free Online Convex Optimization with Stochastic Constraints. CoRR abs/2305.01333 (2023) - 2022
- [j8]Nam Ho-Nguyen
Risk Guarantees for End-to-End Prediction and Optimization Processes. Manag. Sci. 68(12): 8680-8698 (2022) - [j7]Nam Ho-Nguyen
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity. Math. Program. 196(1): 641-672 (2022) - [j6]David Huckleberry Gutman
Cyclic coordinate descent in the Hölder smooth setting. Oper. Res. Lett. 50(5): 458-462 (2022) - [i2]Duksang Lee, Nam Ho-Nguyen, Dabeen Lee:
Non-smooth and Hölder-smooth Submodular Maximization. CoRR abs/2210.06061 (2022) - 2021
- [j5]Nam Ho-Nguyen
Technical Note - Dynamic Data-Driven Estimation of Nonparametric Choice Models. Oper. Res. 69(4): 1228-1239 (2021) - 2020
- [i1]Nam Ho-Nguyen, Stephen J. Wright:
Adversarial Classification via Distributional Robustness with Wasserstein Ambiguity. CoRR abs/2005.13815 (2020)
2010 – 2019
- 2019
- [j4]Nam Ho-Nguyen
Exploiting problem structure in optimization under uncertainty via online convex optimization. Math. Program. 177(1-2): 113-147 (2019) - 2018
- [j3]Nam Ho-Nguyen
Primal-Dual Algorithms for Convex Optimization via Regret Minimization. IEEE Control. Syst. Lett. 2(2): 284-289 (2018) - [j2]Nam Ho-Nguyen
Online First-Order Framework for Robust Convex Optimization. Oper. Res. 66(6): 1670-1692 (2018) - 2017
- [j1]Nam Ho-Nguyen
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants. SIAM J. Optim. 27(3): 1485-1512 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: