Mohamed Amine Bouhlel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mohamed Amine Bouhlel has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Joaquim R. R. A. Martins
University of Michigan
4 shared publications Joseph Morlier
2 shared publications- Nathalie Bartoli
DTIS, ONERA, Université de Toulouse, Toulouse, France
2 shared publications Abdelkader Otsmane
1 shared publicationJohn T. Hwang
1 shared publication- Rommel G. Regis
Saint Joseph’s University
1 shared publication
Latest Publications
- 9 March 2020
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 61 (4) , 1363-1376
Scalable gradient–enhanced artificial neural networks for airfoil shape design in the subsonic and transonic regimes
- 9 March 2020
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 61 (4) , 1363-1376
Scalable gradient–enhanced artificial neural networks for airfoil shape design in the subsonic and transonic regimes
- Top Cited Papers
- 1 September 2019
- Published by Elsevier in Advances in Engineering Software
- Vol. 135, 102662
A Python surrogate modeling framework with derivatives
- 1 September 2019
- Published by Elsevier in Advances in Engineering Software
- Vol. 135, 102662
Top Cited PapersA Python surrogate modeling framework with derivatives
- Top Cited Papers
- 26 February 2018
- Published by Springer Nature in Engineering with Computers
- Vol. 35 (1) , 157-173
Gradient-enhanced kriging for high-dimensional problems
- 26 February 2018
- Published by Springer Nature in Engineering with Computers
- Vol. 35 (1) , 157-173
Top Cited PapersGradient-enhanced kriging for high-dimensional problems
- 1 February 2018
- Published by Taylor & Francis in Engineering Optimization
- Vol. 50 (12) , 2038-2053
Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method
In many engineering optimization problems, the number of function evaluations is often very limited because of the computational cost to run one high-fidelity numerical simulation. Using a classic optimization algorithm, such as a derivative-based algorithm or an evolutionary algorithm, directly on a computational model is not suitable in this case. A common approach to addressing this challenge is to use black-box surrogate modelling techniques. The most popular surrogate-based optimization algorithm is the efficient global optimization (EGO) algorithm, which is an iterative sampling algorithm that adds one (or many) point(s) per iteration. This algorithm is often based on an infill sampling criterion, called expected improvement, which represents a trade-off between promising and uncertain areas. Many studies have shown the efficiency of EGO, particularly when the number of input variables is relatively low. However, its performance on high-dimensional problems is still poor since the Kriging models used are time-consuming to build. To deal with this issue, this article introduces a surrogate-based optimization method that is suited to high-dimensional problems. The method first uses the ‘locating the regional extreme’ criterion, which incorporates minimizing the surrogate model while also maximizing the expected improvement criterion. Then, it replaces the Kriging models by the KPLS(+K) models (Kriging combined with the partial least squares method), which are more suitable for high-dimensional problems. Finally, the proposed approach is validated by a comparison with alternative methods existing in the literature on some analytical functions and on 12-dimensional and 50-dimensional instances of the benchmark automotive problem ‘MOPTA08’.
- 1 February 2018
- Published by Taylor & Francis in Engineering Optimization
- Vol. 50 (12) , 2038-2053
Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method
In many engineering optimization problems, the number of function evaluations is often very limited because of the computational cost to run one high-fidelity numerical simulation. Using a classic optimization algorithm, such as a derivative-based algorithm or an evolutionary algorithm, directly on a computational model is not suitable in this case. A common approach to addressing this challenge is to use black-box surrogate modelling techniques. The most popular surrogate-based optimization algorithm is the efficient global optimization (EGO) algorithm, which is an iterative sampling algorithm that adds one (or many) point(s) per iteration. This algorithm is often based on an infill sampling criterion, called expected improvement, which represents a trade-off between promising and uncertain areas. Many studies have shown the efficiency of EGO, particularly when the number of input variables is relatively low. However, its performance on high-dimensional problems is still poor since the Kriging models used are time-consuming to build. To deal with this issue, this article introduces a surrogate-based optimization method that is suited to high-dimensional problems. The method first uses the ‘locating the regional extreme’ criterion, which incorporates minimizing the surrogate model while also maximizing the expected improvement criterion. Then, it replaces the Kriging models by the KPLS(+K) models (Kriging combined with the partial least squares method), which are more suitable for high-dimensional problems. Finally, the proposed approach is validated by a comparison with alternative methods existing in the literature on some analytical functions and on 12-dimensional and 50-dimensional instances of the benchmark automotive problem ‘MOPTA08’.
- Open Access
Gradient-enhanced kriging for high-dimensional problems
Surrogate models provide a low computational cost alternative to evaluating expensive functions. The construction of accurate surrogate models with large numbers of independent variables is currently prohibitive because it requires a large number of function evaluations. Gradient-enhanced kriging has the potential to reduce the number of function evaluations for the desired accuracy when efficient gradient computation, such as an adjoint method, is available. However, current gradient-enhanced kriging methods do not scale well with the number of sampling points due to the rapid growth in the size of the correlation matrix where new information is added for each sampling point in each direction of the design space. They do not scale well with the number of independent variables either due to the increase in the number of hyperparameters that needs to be estimated. To address this issue, we develop a new gradient-enhanced surrogate model approach that drastically reduced the number of hyperparameters through the use of the partial-least squares method that maintains accuracy. In addition, this method is able to control the size of the correlation matrix by adding only relevant points defined through the information provided by the partial-least squares method. To validate our method, we compare the global accuracy of the proposed method with conventional kriging surrogate models on two analytic functions with up to 100 dimensions, as well as engineering problems of varied complexity with up to 15 dimensions. We show that the proposed method requires fewer sampling points than conventional methods to obtain the desired accuracy, or provides more accuracy for a fixed budget of sampling points. In some cases, we get over 3 times more accurate models than a bench of surrogate models from the literature, and also over 3200 times faster than standard gradient-enhanced kriging models.
Open AccessGradient-enhanced kriging for high-dimensional problems
Surrogate models provide a low computational cost alternative to evaluating expensive functions. The construction of accurate surrogate models with large numbers of independent variables is currently prohibitive because it requires a large number of function evaluations. Gradient-enhanced kriging has the potential to reduce the number of function evaluations for the desired accuracy when efficient gradient computation, such as an adjoint method, is available. However, current gradient-enhanced kriging methods do not scale well with the number of sampling points due to the rapid growth in the size of the correlation matrix where new information is added for each sampling point in each direction of the design space. They do not scale well with the number of independent variables either due to the increase in the number of hyperparameters that needs to be estimated. To address this issue, we develop a new gradient-enhanced surrogate model approach that drastically reduced the number of hyperparameters through the use of the partial-least squares method that maintains accuracy. In addition, this method is able to control the size of the correlation matrix by adding only relevant points defined through the information provided by the partial-least squares method. To validate our method, we compare the global accuracy of the proposed method with conventional kriging surrogate models on two analytic functions with up to 100 dimensions, as well as engineering problems of varied complexity with up to 15 dimensions. We show that the proposed method requires fewer sampling points than conventional methods to obtain the desired accuracy, or provides more accuracy for a fixed budget of sampling points. In some cases, we get over 3 times more accurate models than a bench of surrogate models from the literature, and also over 3200 times faster than standard gradient-enhanced kriging models.