default search action
Nguyen Dinh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c1]Nguyen Dinh, Thanh Dang, Luan Thanh Nguyen, Kiet Van Nguyen:
Multi-Dialect Vietnamese: Task, Dataset, Baseline Models and Challenges. EMNLP 2024: 7476-7498 - 2022
- [j16]Nguyen Dinh, Dang H. Long:
A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel-Lagrange Duality. J. Optim. Theory Appl. 194(2): 713-748 (2022) - 2021
- [j15]Stephan Dempe, Nguyen Dinh, Joydeep Dutta, Tanushree Pandit:
Simple bilevel programming and extensions. Math. Program. 188(1): 227-253 (2021) - [j14]Nguyen Dinh, Miguel A. Goberna, Dang H. Long, Michel Volle:
Duality for constrained robust sum optimization problems. Math. Program. 189(1): 271-297 (2021)
2010 – 2019
- 2019
- [j13]Nguyen Dinh, Miguel A. Goberna, Dang H. Long, Marco Antonio López Cerdá:
New Farkas-Type Results for Vector-Valued Functions: A Non-abstract Approach. J. Optim. Theory Appl. 182(1): 4-29 (2019) - [j12]María J. Cánovas, Nguyen Dinh, Dang H. Long, Juan Parra:
An approach to calmness of linear inequality systems from Farkas lemma. Optim. Lett. 13(2): 295-307 (2019) - [j11]Nguyen Dinh, Miguel A. Goberna, Marco A. López, Michel Volle:
Convexity and closedness in stable robust duality. Optim. Lett. 13(2): 325-339 (2019) - 2017
- [j10]Nguyen Dinh, Miguel A. Goberna, Marco A. López, Tran Hong Mo:
Farkas-Type Results for Vector-Valued Functions with Applications. J. Optim. Theory Appl. 173(2): 357-390 (2017) - [j9]Nguyen Dinh, Miguel Angel Goberna, Marco Antonio López Cerdá, Michel Volle:
A Unifying Approach to Robust Convex Infinite Optimization Duality. J. Optim. Theory Appl. 174(3): 650-685 (2017) - [j8]Nguyen Dinh, Tran Hong Mo, Guy Vallet, Michel Volle:
A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems. SIAM J. Optim. 27(2): 1075-1101 (2017) - 2014
- [j7]Nguyen Dinh, Guy Vallet, Michel Volle:
Functional inequalities and theorems of the alternative involving composite functions. J. Glob. Optim. 59(4): 837-863 (2014) - [j6]Nguyen Dinh, Miguel A. Goberna, Marco A. López, Tran Hong Mo:
From the Farkas Lemma to the Hahn-Banach Theorem. SIAM J. Optim. 24(2): 678-701 (2014) - 2010
- [j5]Nguyen Dinh, Jean-Jacques Strodiot, Van Hien Nguyen:
Duality and optimality conditions for generalized equilibrium problems involving DC functions. J. Glob. Optim. 48(2): 183-208 (2010) - [j4]Nguyen Dinh, Boris S. Mordukhovich, Tran T. A. Nghia:
Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math. Program. 123(1): 101-138 (2010) - [j3]Nguyen Dinh, Miguel A. Goberna, Marco A. López:
On the Stability of the Feasible Set in Optimization Problems. SIAM J. Optim. 20(5): 2254-2280 (2010) - [j2]Nguyen Dinh, Marco A. López, Michel Volle:
Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization. SIAM J. Optim. 20(5): 2540-2559 (2010)
2000 – 2009
- 2006
- [j1]Miguel A. Goberna, Vaithilingam Jeyakumar, Nguyen Dinh:
Dual Characterizations of Set Containments with Strict Convex Inequalities. J. Glob. Optim. 34(1): 33-54 (2006)
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-11-15 20:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint