Inneke Van Nieuwenhuyse
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
Inneke Van Nieuwenhuyse has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Alejandro Morales-Hernández
Research Group Logistics Hasselt University Belgium
7 shared publications - Sebastian Rojas Gonzalez
Ghent University, Ghent, Belgium
6 shared publications - Bart Van Doninck
Flanders Make
4 shared publications - Ivo Couckuyt
Ghent University, Ghent, Belgium
4 shared publications - Jeroen Jordens
Flanders Make
4 shared publications - Maarten Witters
Flanders Make
4 shared publications
Latest Publications
- 7 October 2026
- Published by Elsevier in Journal of Power Sources
- Vol. 698
Tracking lithium-ion battery degradation with robust voltage–capacity signatures
- 7 October 2026
- Published by Elsevier in Journal of Power Sources
- Vol. 698
Tracking lithium-ion battery degradation with robust voltage–capacity signatures
- 2 January 2026
- Published by Springer Nature
- p. 167-182
Decision Maker Preferences in Surrogate-Based Multi-objective Optimization: A Survey
- 2 January 2026
- Published by Springer Nature
- p. 167-182
Decision Maker Preferences in Surrogate-Based Multi-objective Optimization: A Survey
- Top Cited PapersOpen Access
- 25 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 1581-1593
Constrained Bayesian Optimization: A Review
Bayesian optimization is a sequential optimization method that is particularly well suited for problems with limited computational budgets involving expensive and non-convex black-box functions. Though it has been widely used to solve various optimization tasks, most of the literature has focused on unconstrained settings, while many real-world problems are characterized by constraints. This paper reviews the current literature on single-objective constrained Bayesian optimization, classifying it according to three main algorithmic aspects: ( i ) the metamodel, ( ii ) the acquisition function, and ( iii ) the identification procedure. We discuss the current methods in each of these categories and conclude by a discussion of real-world applications and highlighting the main shortcomings in the literature, providing some promising directions for future research.
- 25 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 1581-1593
Top Cited PapersOpen AccessConstrained Bayesian Optimization: A Review
Bayesian optimization is a sequential optimization method that is particularly well suited for problems with limited computational budgets involving expensive and non-convex black-box functions. Though it has been widely used to solve various optimization tasks, most of the literature has focused on unconstrained settings, while many real-world problems are characterized by constraints. This paper reviews the current literature on single-objective constrained Bayesian optimization, classifying it according to three main algorithmic aspects: ( i ) the metamodel, ( ii ) the acquisition function, and ( iii ) the identification procedure. We discuss the current methods in each of these categories and conclude by a discussion of real-world applications and highlighting the main shortcomings in the literature, providing some promising directions for future research.
- 29 November 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 91 (4) , 897-922
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions
- 29 November 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 91 (4) , 897-922
Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions
- 15 November 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 322 (2) , 599-614
Bi-objective ranking and selection using stochastic kriging
- 15 November 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 322 (2) , 599-614
Bi-objective ranking and selection using stochastic kriging
- Open Access
- 11 January 2024
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 581, 111721
Who acquires infection from whom? A sensitivity analysis of transmission dynamics during the early phase of the COVID-19 pandemic in Belgium
- 11 January 2024
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 581, 111721
Open AccessWho acquires infection from whom? A sensitivity analysis of transmission dynamics during the early phase of the COVID-19 pandemic in Belgium
- 10 January 2024
- Published by Springer Nature in Engineering with Computers
- Vol. 40 (4) , 2497-2511
Bayesian multi-objective optimization of process design parameters in constrained settings with noise: an engineering design application
- 10 January 2024
- Published by Springer Nature in Engineering with Computers
- Vol. 40 (4) , 2497-2511
Bayesian multi-objective optimization of process design parameters in constrained settings with noise: an engineering design application
- 15 October 2023
- Published by Springer Nature in Engineering with Computers
- Vol. 40 (4) , 2143-2159
Cheap-expensive multi-objective Bayesian optimization for permanent magnet synchronous motor design
- 15 October 2023
- Published by Springer Nature in Engineering with Computers
- Vol. 40 (4) , 2143-2159
Cheap-expensive multi-objective Bayesian optimization for permanent magnet synchronous motor design
- 27 May 2023
- Published by Springer Nature
- p. 213-223
Multi-objective Optimization of Adhesive Bonding Process in Constrained and Noisy Settings
- 27 May 2023
- Published by Springer Nature
- p. 213-223
Multi-objective Optimization of Adhesive Bonding Process in Constrained and Noisy Settings
- Open Access
Constrained multi-objective optimization of process design parameters in settings with scarce data: an application to adhesive bonding
Adhesive joints are increasingly used in industry for a wide variety of applications because of their favorable characteristics such as high strength-to-weight ratio, design flexibility, limited stress concentrations, planar force transfer, good damage tolerance, and fatigue resistance. Finding the optimal process parameters for an adhesive bonding process is challenging: the optimization is inherently multi-objective (aiming to maximize break strength while minimizing cost), constrained (the process should not result in any visual damage to the materials, and stress tests should not result in failures that are adhesion-related), and uncertain (testing the same process parameters several times may lead to different break strengths). Real-life physical experiments in the lab are expensive to perform. Traditional evolutionary approaches (such as genetic algorithms) are then ill-suited to solve the problem, due to the prohibitive amount of experiments required for evaluation. Although Bayesian optimization-based algorithms are preferred to solve such expensive problems, few methods consider the optimization of more than one (noisy) objective and several constraints at the same time. In this research, we successfully applied specific machine learning techniques (Gaussian Process Regression) to emulate the objective and constraint functions based on a limited amount of experimental data. The techniques are embedded in a Bayesian optimization algorithm, which succeeds in detecting Pareto-optimal process settings in a highly efficient way (i.e., requiring a limited number of physical experiments).
Open AccessConstrained multi-objective optimization of process design parameters in settings with scarce data: an application to adhesive bonding
Adhesive joints are increasingly used in industry for a wide variety of applications because of their favorable characteristics such as high strength-to-weight ratio, design flexibility, limited stress concentrations, planar force transfer, good damage tolerance, and fatigue resistance. Finding the optimal process parameters for an adhesive bonding process is challenging: the optimization is inherently multi-objective (aiming to maximize break strength while minimizing cost), constrained (the process should not result in any visual damage to the materials, and stress tests should not result in failures that are adhesion-related), and uncertain (testing the same process parameters several times may lead to different break strengths). Real-life physical experiments in the lab are expensive to perform. Traditional evolutionary approaches (such as genetic algorithms) are then ill-suited to solve the problem, due to the prohibitive amount of experiments required for evaluation. Although Bayesian optimization-based algorithms are preferred to solve such expensive problems, few methods consider the optimization of more than one (noisy) objective and several constraints at the same time. In this research, we successfully applied specific machine learning techniques (Gaussian Process Regression) to emulate the objective and constraint functions based on a limited amount of experimental data. The techniques are embedded in a Bayesian optimization algorithm, which succeeds in detecting Pareto-optimal process settings in a highly efficient way (i.e., requiring a limited number of physical experiments).