Hoai An Le Thi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hoai An Le Thi has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Tao Pham Dinh
Laboratory of Mathematics, INSA-Rouen, University of Normandie, 76801 Saint-Etienne-du-Rouvray Cedex, France
15 shared publications - Mahdi Moeini
ENSIIE 1 Place de la Résistance 91000 Évry-Courcouronnes France
4 shared publications - Hoai Minh Le
Laboratoire de Mathématique Appliquée du Havre
3 shared publications Tao Pham Dinh
National Institute for Applied Sciences
3 shared publications- Duc Quynh Tran
University of Lorraine
2 shared publications - Huynh Van Ngai
Department of Mathematics, University of Quynhon, Qui Nhon, Vietnam
2 shared publications
Latest Publications
- Open Access
A DC programming approach for constrained two-dimensional non-guillotine cutting problem
We investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reformulate this problem as a DC program and solve it by DCA. The performance of the approach is compared with the standard solver CPLEX.
Open AccessA DC programming approach for constrained two-dimensional non-guillotine cutting problem
We investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reformulate this problem as a DC program and solve it by DCA. The performance of the approach is compared with the standard solver CPLEX.
- Open Access
Portfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA
In matter of Portfolio selection, we consider a generalization of the Markowitz Mean-Variance model which includes buy-in threshold constraints. These constraints limit the amount of capital to be invested in each asset and prevent very small investments in any asset. The new model can be converted into a NP-hard mixed integer quadratic programming problem. The purpose of this paper is to investigate a continuous approach based on DC programming and DCA for solving this new model. DCA is a local continuous approach to solve a wide variety of nonconvex programs for which it provided quite often a global solution and proved to be more robust and efficient than standard methods. Preliminary comparative results of DCA and a classical Branch-and-Bound algorithm will be presented. These results show that DCA is an efficient and promising approach for the considered portfolio selection problem.
Open AccessPortfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA
In matter of Portfolio selection, we consider a generalization of the Markowitz Mean-Variance model which includes buy-in threshold constraints. These constraints limit the amount of capital to be invested in each asset and prevent very small investments in any asset. The new model can be converted into a NP-hard mixed integer quadratic programming problem. The purpose of this paper is to investigate a continuous approach based on DC programming and DCA for solving this new model. DCA is a local continuous approach to solve a wide variety of nonconvex programs for which it provided quite often a global solution and proved to be more robust and efficient than standard methods. Preliminary comparative results of DCA and a classical Branch-and-Bound algorithm will be presented. These results show that DCA is an efficient and promising approach for the considered portfolio selection problem.
- 1 August 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 830-854
Learning sparse classifiers with difference of convex functions algorithms
Sparsity of a classifier is a desirable condition for high-dimensional data and large sample sizes. This paper investigates the two complementary notions of sparsity for binary classification: sparsity in the number of features and sparsity in the number of examples. Several different losses and regularizers are considered: the hinge loss and ramp loss, and ℓ2, ℓ1, approximate ℓ0, and capped ℓ1 regularization. We propose three new objective functions that further promote sparsity, the capped ℓ1 regularization with hinge loss, and the ramp loss versions of approximate ℓ0 and capped ℓ1 regularization. We derive difference of convex functions algorithms (DCA) for solving these novel non-convex objective functions. The proposed algorithms are shown to converge in a finite number of iterations to a local minimum. Using simulated data and several data sets from the University of California Irvine (UCI) machine learning repository, we empirically investigate the fraction of features and examples required by the different classifiers.
- 1 August 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 830-854
Learning sparse classifiers with difference of convex functions algorithms
Sparsity of a classifier is a desirable condition for high-dimensional data and large sample sizes. This paper investigates the two complementary notions of sparsity for binary classification: sparsity in the number of features and sparsity in the number of examples. Several different losses and regularizers are considered: the hinge loss and ramp loss, and ℓ2, ℓ1, approximate ℓ0, and capped ℓ1 regularization. We propose three new objective functions that further promote sparsity, the capped ℓ1 regularization with hinge loss, and the ramp loss versions of approximate ℓ0 and capped ℓ1 regularization. We derive difference of convex functions algorithms (DCA) for solving these novel non-convex objective functions. The proposed algorithms are shown to converge in a finite number of iterations to a local minimum. Using simulated data and several data sets from the University of California Irvine (UCI) machine learning repository, we empirically investigate the fraction of features and examples required by the different classifiers.
- 1 August 2013
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (1) , 5-24
New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains
- 1 August 2013
- Published by Springer Nature in Journal of Global Optimization
- Vol. 60 (1) , 5-24
New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains
- 1 August 2012
- Published by Taylor & Francis in Optimization
- Vol. 61 (8) , 1025-1038
Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA
In this article, we consider the application of a continuous min–max model with cardinality constraints to worst-case portfolio selection with multiple scenarios of risk, where the return forecast of each asset belongs to an interval. The problem can be formulated as minimizing a convex function under mixed integer variables with additional complementarity constraints. We first prove that the complementarity constraints can be eliminated and then use Difference of Convex functions (DC) programming and DC Algorithm (DCA), an innovative approach in non-convex programming frameworks, to solve the resulting problem. We reformulate it as a DC program and then show how to apply DCA to solve it. Numerical experiments on several test problems are reported that demonstrate the accuracy of the proposed algorithm.
- 1 August 2012
- Published by Taylor & Francis in Optimization
- Vol. 61 (8) , 1025-1038
Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA
In this article, we consider the application of a continuous min–max model with cardinality constraints to worst-case portfolio selection with multiple scenarios of risk, where the return forecast of each asset belongs to an interval. The problem can be formulated as minimizing a convex function under mixed integer variables with additional complementarity constraints. We first prove that the complementarity constraints can be eliminated and then use Difference of Convex functions (DC) programming and DC Algorithm (DCA), an innovative approach in non-convex programming frameworks, to solve the resulting problem. We reformulate it as a DC program and then show how to apply DCA to solve it. Numerical experiments on several test problems are reported that demonstrate the accuracy of the proposed algorithm.
- 11 February 2012
- Published by Springer Nature in Journal of Global Optimization
- Vol. 56 (4) , 1393-1407
Binary classification via spherical separator by DC programming and DCA
- 11 February 2012
- Published by Springer Nature in Journal of Global Optimization
- Vol. 56 (4) , 1393-1407
Binary classification via spherical separator by DC programming and DCA
- Open Access
- 1 January 2012
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 2 (1) , 167-185
A DC programming approach for a class of bilevel programming problems and its application in Portfolio Selection
In this paper, we consider a class of bilevel programming problems where the upper objective function is convex quadratic while the lower objective function and the constraints are linear. The problem is first rewritten as minimizing a convex quadratic function subject to linear constraints and one concave constraint. Then, we use an exact penalty technique to reformulate the problem as a DC program. Afterward, DCA, an efficient algorithm in nonconvex programming, is developed to solve the resulting problem.     For globally solving the problem, we combine DCA with a Branch and Bound algorithm (BB-DCA). DCA is applied to compute upper bounds, while lower bounds are calculated via a DC relaxation of the DC constraint. The proposed algorithms, DCA and BB-DCA, are compared with the Branch-and-Bound algorithm without DCA (BB) on random data. The numerical results show that the proposed algorithms are efficient.     Finally, we consider an application of portfolio selection problems with the historical data related to the prices in the market of France, Luxembourg, United States and England during the period 2000-2007. The experimental results confirm the efficiency and the rapidity of DCA.
- 1 January 2012
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 2 (1) , 167-185
Open AccessA DC programming approach for a class of bilevel programming problems and its application in Portfolio Selection
In this paper, we consider a class of bilevel programming problems where the upper objective function is convex quadratic while the lower objective function and the constraints are linear. The problem is first rewritten as minimizing a convex quadratic function subject to linear constraints and one concave constraint. Then, we use an exact penalty technique to reformulate the problem as a DC program. Afterward, DCA, an efficient algorithm in nonconvex programming, is developed to solve the resulting problem.     For globally solving the problem, we combine DCA with a Branch and Bound algorithm (BB-DCA). DCA is applied to compute upper bounds, while lower bounds are calculated via a DC relaxation of the DC constraint. The proposed algorithms, DCA and BB-DCA, are compared with the Branch-and-Bound algorithm without DCA (BB) on random data. The numerical results show that the proposed algorithms are efficient.     Finally, we consider an application of portfolio selection problems with the historical data related to the prices in the market of France, Luxembourg, United States and England during the period 2000-2007. The experimental results confirm the efficiency and the rapidity of DCA.
- 27 September 2011
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 50 (3) , 463-464
International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences
- 27 September 2011
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 50 (3) , 463-464
International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences
- 24 September 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 52 (3) , 509-535
Exact penalty and error bounds in DC programming
- 24 September 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 52 (3) , 509-535
Exact penalty and error bounds in DC programming
- 10 March 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 53 (2) , 317-329
Behavior of DCA sequences for solving the trust-region subproblem
- 10 March 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 53 (2) , 317-329
Behavior of DCA sequences for solving the trust-region subproblem