Nguyen Dinh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Nguyen Dinh has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Miguel Angel Goberna
Department of Mathematics, University of Alicante, Alicante, Spain
11 shared publications - Dang Hai Long
VNUHCM - University of Science, Ho Chi Minh city, Vietnam
7 shared publications - Michel Volle
Avignon University, Avignon, France
7 shared publications - Marco Antonio López
Department of Mathematics, University of Alicante, San Vicente del Raspeig, Spain
6 shared publications - D. H. Long
Vietnam National University - HCMC, Ho Chi Minh City, Vietnam
3 shared publications - Guy Vallet
Laboratoire de Mathématiques et Applications de Pau, UMR CNRS 5142, Pau Cedex, France
3 shared publications
Latest Publications
- 26 September 2026
- Published by Springer Nature in TOP
- p. 1-22
Robust generalized S-procedure revisited with applications to robust optimization problems
- 26 September 2026
- Published by Springer Nature in TOP
- p. 1-22
Robust generalized S-procedure revisited with applications to robust optimization problems
- 5 February 2026
- Published by Springer Nature in Vietnam Journal of Mathematics
Robust Generalized S-Procedure
- 5 February 2026
- Published by Springer Nature in Vietnam Journal of Mathematics
Robust Generalized S-Procedure
- Open Access
Robust generalized S-Procedure
We introduce in this paper the so-called robust generalized S-procedure associated with a given robust optimization problem. We provide a primal characterization for the validity of this procedure as well as a dual characterization under the assumption that the decision space is locally convex. We also analyze an extension of the mentioned robust S-procedure that incorporates a right-hand side function.
Open AccessRobust generalized S-Procedure
We introduce in this paper the so-called robust generalized S-procedure associated with a given robust optimization problem. We provide a primal characterization for the validity of this procedure as well as a dual characterization under the assumption that the decision space is locally convex. We also analyze an extension of the mentioned robust S-procedure that incorporates a right-hand side function.
- Open Access
- 22 August 2025
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 33 (3) , 1-24
Primal and Dual Characterizations for Farkas Type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a convex function $f$ contains a set of the form $C\cap \mathbb{A}^{-1}\left ( D\right ) $ , where $C$ and $D$ are convex sets (not necessarily cones) in locally convex spaces $X$ (with topological dual $X^{\prime }$ ) and $Y$ , respectively, while $\mathbb{A}$ is a continuous linear operator from $X$ to $Y$ . More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the “primal” spaces $X\times Y\times \mathbb{R}$ and $Y\times \mathbb{R}$ , or of the “dual” space $X^{\prime }\times \mathbb{R}$ , regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set $C\cap \mathbb{A}^{-1}\left ( D\right ) $ in terms of the closedness of certain subset of the dual space $X^{\prime }\times \mathbb{R}$ regarding the singleton set formed by the null element. These results are illustrated with significant applications to constrained convex minimization problems and to functional approximation by polynomials.- 22 August 2025
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 33 (3) , 1-24
Open AccessPrimal and Dual Characterizations for Farkas Type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a convex function $f$ contains a set of the form $C\cap \mathbb{A}^{-1}\left ( D\right ) $ , where $C$ and $D$ are convex sets (not necessarily cones) in locally convex spaces $X$ (with topological dual $X^{\prime }$ ) and $Y$ , respectively, while $\mathbb{A}$ is a continuous linear operator from $X$ to $Y$ . More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the “primal” spaces $X\times Y\times \mathbb{R}$ and $Y\times \mathbb{R}$ , or of the “dual” space $X^{\prime }\times \mathbb{R}$ , regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set $C\cap \mathbb{A}^{-1}\left ( D\right ) $ in terms of the closedness of certain subset of the dual space $X^{\prime }\times \mathbb{R}$ regarding the singleton set formed by the null element. These results are illustrated with significant applications to constrained convex minimization problems and to functional approximation by polynomials. - 26 April 2025
- Published by Springer Nature
- p. 159-224
A Perturbation Approach to Vector Optimization Problems
- 26 April 2025
- Published by Springer Nature
- p. 159-224
A Perturbation Approach to Vector Optimization Problems
- Open Access
Primal and Dual Characterizations for Farkas type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a given convex function contains the intersection, say F, of a convex set of a locally convex space X with the inverse image by a continuous linear operator from X to another locally convex space Y of certain convex subset of Y. More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the "primal" spaces XxYxR and YxR, or of the "dual" space X'xR, regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set F in terms of the closedness of certain subset of the dual space X'xR regarding the singleton set formed by the null element. These results are illustrated with significant applications.
Open AccessPrimal and Dual Characterizations for Farkas type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a given convex function contains the intersection, say F, of a convex set of a locally convex space X with the inverse image by a continuous linear operator from X to another locally convex space Y of certain convex subset of Y. More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the "primal" spaces XxYxR and YxR, or of the "dual" space X'xR, regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set F in terms of the closedness of certain subset of the dual space X'xR regarding the singleton set formed by the null element. These results are illustrated with significant applications.
- Open Access
- 1 January 2023
- Published by Viet Nam National University Ho Chi Minh City in Journal of Science and Technology Development
- Vol. 26 (3) , 2987-2995
Stable strong duality for cone-constrained set-valued optimization problems: A perturbation approach
In this paper we consider a general set-valued otimimization problem of the model Winf F(x), s.t. x in X where $F\colon X\rightrightarrows Y\cup\{+\infty_{Y}\}$ is a proper mapping. The problem is then embed into a parametric problem and can be express as (P) $\mathop{\winf}\bigcup\limits_{x\in X}\Phi(x,0_Z)$ where $\Phi\colon X\times Z\rightrightarrows Y^\bullet$ is a proper set-valued {\it perturbation mapping} such that $ \Phi(x,0_Z) = F(x) $. A representation of the epigraph of the conjugate mapping $\Phi^\ast$ is established (Theorem 1) and it is used as the basic tool for establishing a general stable strong duality for the problem (P) (Theorem 3). As applications, the mentioned general strong duality result is then applied to a cone-constrained set-valued optimization problem (CSP) to derive three dual problems for (CSP): The Lagrange dual problem and two forms of Fenchel-Lagrange dual problems for (CSP). Consequently, three stable strong duality results for the three primal-dual pairs of problems are derived (Theorems 4 and 5), among them, one is entirely new while the others extend some known ones in the literature.- 1 January 2023
- Published by Viet Nam National University Ho Chi Minh City in Journal of Science and Technology Development
- Vol. 26 (3) , 2987-2995
Open AccessStable strong duality for cone-constrained set-valued optimization problems: A perturbation approach
In this paper we consider a general set-valued otimimization problem of the model Winf F(x), s.t. x in X where $F\colon X\rightrightarrows Y\cup\{+\infty_{Y}\}$ is a proper mapping. The problem is then embed into a parametric problem and can be express as (P) $\mathop{\winf}\bigcup\limits_{x\in X}\Phi(x,0_Z)$ where $\Phi\colon X\times Z\rightrightarrows Y^\bullet$ is a proper set-valued {\it perturbation mapping} such that $ \Phi(x,0_Z) = F(x) $. A representation of the epigraph of the conjugate mapping $\Phi^\ast$ is established (Theorem 1) and it is used as the basic tool for establishing a general stable strong duality for the problem (P) (Theorem 3). As applications, the mentioned general strong duality result is then applied to a cone-constrained set-valued optimization problem (CSP) to derive three dual problems for (CSP): The Lagrange dual problem and two forms of Fenchel-Lagrange dual problems for (CSP). Consequently, three stable strong duality results for the three primal-dual pairs of problems are derived (Theorems 4 and 5), among them, one is entirely new while the others extend some known ones in the literature. - 22 July 2022
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 30 (4) , 1381-1402
Convex Robust Sum Optimization Problems with Conic and Set Constraints: Duality and Optimality Conditions Revisited
- 22 July 2022
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 30 (4) , 1381-1402
Convex Robust Sum Optimization Problems with Conic and Set Constraints: Duality and Optimality Conditions Revisited
- 20 June 2022
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 194 (2) , 713-748
A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel–Lagrange Duality
- 20 June 2022
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 194 (2) , 713-748
A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel–Lagrange Duality
- 3 March 2022
- Published by Taylor & Francis in Optimization
- Vol. 72 (6) , 1429-1461
New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems
In this paper, we concern the vector problem: where X, Y, Z are locally convex Hausdorff topological vector spaces, and are proper mappings, C is a nonempty convex subset of X, and S is a non-empty closed, convex cone in Z. Several new presentations of epigraphs of composite conjugate mappings associated to (VP) are established under variant qualifying conditions. The significance of these representations is twofold: Firstly, they play a key role in establishing new kinds of vector Farkas lemmas which serve as tools in the study of vector optimization problems; secondly, they pay the way to define Lagrange and two new kinds of Fenchel–Lagrange dual problems for (VP). Strong and stable strong duality results corresponding to these mentioned dual problems of (VP) are established using the new Farkas-type results just obtained. It is shown that in the special case where , the Lagrange and Fenchel–Lagrange dual problems for (VP), go back to Lagrange, and Fenchel–Lagrange dual problems for scalar problems, and the resulting duality results cover, and in some cases, extend the corresponding ones for scalar problems in the literature.- 3 March 2022
- Published by Taylor & Francis in Optimization
- Vol. 72 (6) , 1429-1461
New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems
In this paper, we concern the vector problem: where X, Y, Z are locally convex Hausdorff topological vector spaces, and are proper mappings, C is a nonempty convex subset of X, and S is a non-empty closed, convex cone in Z. Several new presentations of epigraphs of composite conjugate mappings associated to (VP) are established under variant qualifying conditions. The significance of these representations is twofold: Firstly, they play a key role in establishing new kinds of vector Farkas lemmas which serve as tools in the study of vector optimization problems; secondly, they pay the way to define Lagrange and two new kinds of Fenchel–Lagrange dual problems for (VP). Strong and stable strong duality results corresponding to these mentioned dual problems of (VP) are established using the new Farkas-type results just obtained. It is shown that in the special case where , the Lagrange and Fenchel–Lagrange dual problems for (VP), go back to Lagrange, and Fenchel–Lagrange dual problems for scalar problems, and the resulting duality results cover, and in some cases, extend the corresponding ones for scalar problems in the literature.