Truong Xuan Duc Ha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Truong Xuan Duc Ha has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Jen-Chih Yao
Research Center for Interneural Computing, China Medical University Hospital, China Medical University, Taichung, Taiwan
1 shared publication - Johannes Jahn
Universität Erlangen-Nürnberg
1 shared publication - Tien-Son Pham
Department of Mathematics, Dalat University, Dalat, Vietnam
1 shared publication
Latest Publications
- 2 February 2023
- Published by Taylor & Francis in Optimization
- Vol. 73 (5) , 1645-1679
A unified scheme for scalarization in set optimization
In this work, we propose a new scheme for scalarization in set optimization studied with the Kuroiwa set approach. First, we define an abstract scalarizing function possessing properties such as global Lipschizity, sublinearity, cone monotonicity, cone representation property, cone interior representation property and uniform positivity. Next, we use this function to define the so-called signed Hausdorff-type half-distances and Hausdorff-type distances. As the first applications, we obtain characterizations of Kuroiwa's set order relations and some optimal solutions of a set optimization problem. This scheme provides a unified approach to scalarization involving different scalarizing functions such as the Gerstewizt (Tammer) function, the Hiriart–Urruty signed distance and the function proposed by Kasimbeyli.
- 2 February 2023
- Published by Taylor & Francis in Optimization
- Vol. 73 (5) , 1645-1679
A unified scheme for scalarization in set optimization
In this work, we propose a new scheme for scalarization in set optimization studied with the Kuroiwa set approach. First, we define an abstract scalarizing function possessing properties such as global Lipschizity, sublinearity, cone monotonicity, cone representation property, cone interior representation property and uniform positivity. Next, we use this function to define the so-called signed Hausdorff-type half-distances and Hausdorff-type distances. As the first applications, we obtain characterizations of Kuroiwa's set order relations and some optimal solutions of a set optimization problem. This scheme provides a unified approach to scalarization involving different scalarizing functions such as the Gerstewizt (Tammer) function, the Hiriart–Urruty signed distance and the function proposed by Kasimbeyli.
- Open Access
- 1 January 2021
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 28 (1) , 157-178
Versions of the Sard Theorem for Essentially Smooth Lipschitz Maps and Applications in Optimization and Nonsmooth Equations
The classical Sard theorem (in a special case) states that the set of critical values of a C^1 C 1 -map from an open set of \mathbb{R}^n R n to \mathbb{R}^n R n has Lebesgue measure zero. Motivated by a recent work of Barbet, Dambrine, Daniilidis and Rifford [Sard theorems for Lipschitz functions and applications in optimization, Israel J. Math. 212 (2016) 757-–790], we obtain in this paper versions of this theorem for a finite family of essentially smooth Lipschitz maps and for a locally Lipschitz continuous selection of this family. Here, a locally Lipschitz map is essentially smooth if its Clarke's subdifferential reduces to a singleton almost everywhere. As applications, we establish the genericity of Karush-Kuhn-Tucker type necessary condition for scalar/vector parametrized constrained optimization problems, Lebesgue zero measure of the set of Pareto optimal values of a map and the genericity of the finiteness of the solution set for a nonsmooth equation.
- 1 January 2021
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 28 (1) , 157-178
Open AccessVersions of the Sard Theorem for Essentially Smooth Lipschitz Maps and Applications in Optimization and Nonsmooth Equations
The classical Sard theorem (in a special case) states that the set of critical values of a C^1 C 1 -map from an open set of \mathbb{R}^n R n to \mathbb{R}^n R n has Lebesgue measure zero. Motivated by a recent work of Barbet, Dambrine, Daniilidis and Rifford [Sard theorems for Lipschitz functions and applications in optimization, Israel J. Math. 212 (2016) 757-–790], we obtain in this paper versions of this theorem for a finite family of essentially smooth Lipschitz maps and for a locally Lipschitz continuous selection of this family. Here, a locally Lipschitz map is essentially smooth if its Clarke's subdifferential reduces to a singleton almost everywhere. As applications, we establish the genericity of Karush-Kuhn-Tucker type necessary condition for scalar/vector parametrized constrained optimization problems, Lebesgue zero measure of the set of Pareto optimal values of a map and the genericity of the finiteness of the solution set for a nonsmooth equation.
- 26 July 2019
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 91 (1) , 137-158
A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa’s set approach
- 26 July 2019
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 91 (1) , 137-158
A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa’s set approach
- 13 February 2018
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 176 (3) , 634-649
Slopes, Error Bounds and Weak Sharp Pareto Minima of a Vector-Valued Map
- 13 February 2018
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 176 (3) , 634-649
Slopes, Error Bounds and Weak Sharp Pareto Minima of a Vector-Valued Map
- 4 January 2018
- Published by Taylor & Francis in Optimization
- Vol. 67 (7) , 1031-1050
A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization
In this paper, we follow Kuroiwa’s set approach in set optimization, which proposes to compare values of a set-valued objective map F with respect to various set order relations. We introduce a Hausdorff-type distance relative to an ordering cone between two sets in a Banach space and use it to define a directional derivative for F. We show that the distance has nice properties regarding set order relations and the directional derivative enjoys most properties of the one of a scalar single-valued function. These properties allow us to derive necessary and/or sufficient conditions for various types of maximizers and minimizers of F.
- 4 January 2018
- Published by Taylor & Francis in Optimization
- Vol. 67 (7) , 1031-1050
A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization
In this paper, we follow Kuroiwa’s set approach in set optimization, which proposes to compare values of a set-valued objective map F with respect to various set order relations. We introduce a Hausdorff-type distance relative to an ordering cone between two sets in a Banach space and use it to define a directional derivative for F. We show that the distance has nice properties regarding set order relations and the directional derivative enjoys most properties of the one of a scalar single-valued function. These properties allow us to derive necessary and/or sufficient conditions for various types of maximizers and minimizers of F.
- 28 June 2017
- Published by Springer Nature in Positivity
- Vol. 22 (1) , 219-244
The global weak sharp minima with explicit exponents in polynomial vector optimization problems
- 28 June 2017
- Published by Springer Nature in Positivity
- Vol. 22 (1) , 219-244
The global weak sharp minima with explicit exponents in polynomial vector optimization problems
- 24 May 2016
- Published by Taylor & Francis in Optimization
- Vol. 65 (10) , 1781-1789
A remark on the lower semicontinuity assumption in the Ekeland variational principle
What happens to the conclusion of the Ekeland variational principle (briefly, EVP) if a considered function is lower semicontinuous not on the whole metric space X but only on its domain? We provide a straightforward proof showing that it still holds but only for varying in some interval , where is a quantity expressing quantitatively the violation in the lower semicontinuity of f outside its domain. The obtained result extends EVP to a larger class of functions. As applications, we obtain some results about properties of Gâteaux differentiable functions on Banach spaces.
- 24 May 2016
- Published by Taylor & Francis in Optimization
- Vol. 65 (10) , 1781-1789
A remark on the lower semicontinuity assumption in the Ekeland variational principle
What happens to the conclusion of the Ekeland variational principle (briefly, EVP) if a considered function is lower semicontinuous not on the whole metric space X but only on its domain? We provide a straightforward proof showing that it still holds but only for varying in some interval , where is a quantity expressing quantitatively the violation in the lower semicontinuity of f outside its domain. The obtained result extends EVP to a larger class of functions. As applications, we obtain some results about properties of Gâteaux differentiable functions on Banach spaces.
- 18 November 2015
- Published by Springer Nature
- p. 249-273
Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem
- 18 November 2015
- Published by Springer Nature
- p. 249-273
Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem
- 29 February 2012
- Published by Elsevier in Nonlinear Analysis
- Vol. 75 (3) , 1305-1323
Optimality conditions for various efficient solutions involving coderivatives: From set-valued optimization problems to set-valued equilibrium problems
- 29 February 2012
- Published by Elsevier in Nonlinear Analysis
- Vol. 75 (3) , 1305-1323
Optimality conditions for various efficient solutions involving coderivatives: From set-valued optimization problems to set-valued equilibrium problems