Susanne Sass
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Susanne Sass has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Mitsos
RWTH Aachen University
4 shared publications - Angelos Tsoukalas
Department of Technology and Operations Management, RSM Erasmus University Rotterdam, Rotterdam, Netherlands
3 shared publications - Dominik Bongartz
Department of Chemical Engineering, KU Leuven
2 shared publications - Ian H. Bell
Applied Chemicals and Materials Division, National Institute of Standards and Technology, Boulder, USA
2 shared publications - Nikolay I. Nikolov
Institute of Statistics, RWTH Aachen University, Aachen, Germany
2 shared publications - Jaromił Najman
Process Systems Engineering (AVT.SVT), RWTH Aachen University, Aachen, Germany
1 shared publication
Latest Publications
- Open Access
- 24 August 2025
- Published by Elsevier in Journal of Process Control
- Vol. 154
Obscured by terminology: Hidden parallels in direct methods for open-loop optimal control
- 24 August 2025
- Published by Elsevier in Journal of Process Control
- Vol. 154
Open AccessObscured by terminology: Hidden parallels in direct methods for open-loop optimal control
- Open Access
- 23 June 2025
- Published by Springer Nature in Journal of Global Optimization
- Vol. 92 (3) , 615-642
Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
In [Sass et al., Eur. J. Oper. Res., 316 (1): 36 – 45, 2024], we proposed a branch-and-bound (B&B) algorithm with growing datasets for the deterministic global optimization of parameter estimation problems based on large datasets. Therein, we start the B&B algorithm with a reduced dataset and augment it until reaching the full dataset upon convergence. However, convergence may be slowed down by a gap between the lower bounds of the reduced and the original problem, in particular for noisy measurement data. Thus, we propose the use of out-of-sample estimation for improving the lower bounds calculated with reduced datasets. Based on this, we extend the deterministic approach and propose two heuristic approaches. The computational performance of all approaches is compared with the standard B&B algorithm as a benchmark based on real-world estimation problems from process systems engineering, biochemistry, and machine learning covering datasets with and without measurement noise. Our results indicate that the heuristic approaches can improve the final lower bounds on the optimal objective value without cutting off the global solution. Aside from this, we prove that resampling can decrease the variance of the lower bounds calculated based on random initial datasets. In our case study, resampling hardly affects the performance of the approaches which indicates that the B&B algorithm with growing datasets does not suffer from large variances.
- 23 June 2025
- Published by Springer Nature in Journal of Global Optimization
- Vol. 92 (3) , 615-642
Open AccessOut-of-sample estimation for a branch-and-bound algorithm with growing datasets
In [Sass et al., Eur. J. Oper. Res., 316 (1): 36 – 45, 2024], we proposed a branch-and-bound (B&B) algorithm with growing datasets for the deterministic global optimization of parameter estimation problems based on large datasets. Therein, we start the B&B algorithm with a reduced dataset and augment it until reaching the full dataset upon convergence. However, convergence may be slowed down by a gap between the lower bounds of the reduced and the original problem, in particular for noisy measurement data. Thus, we propose the use of out-of-sample estimation for improving the lower bounds calculated with reduced datasets. Based on this, we extend the deterministic approach and propose two heuristic approaches. The computational performance of all approaches is compared with the standard B&B algorithm as a benchmark based on real-world estimation problems from process systems engineering, biochemistry, and machine learning covering datasets with and without measurement noise. Our results indicate that the heuristic approaches can improve the final lower bounds on the optimal objective value without cutting off the global solution. Aside from this, we prove that resampling can decrease the variance of the lower bounds calculated based on random initial datasets. In our case study, resampling hardly affects the performance of the approaches which indicates that the B&B algorithm with growing datasets does not suffer from large variances.
- Open Access
- 23 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (1) , 36-45
A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- 23 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (1) , 36-45
Open AccessA branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Open Access
- 9 May 2023
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 38 (6) , 1129-1141
Towards global parameter estimation exploiting reduced data sets
We focus on deterministic global optimization (DGO) for nonconvex parameter estimation problems. Realistic and accurate solutions often require a fitting against very large measurement data sets, resulting in intractable size for DGO. Thus, we aim at accelerating the branch-and-bound algorithm by using reduced data sets for constructing valid bounds. We focus on fitting the equation of state for propane, which is of high interest for the chemical industry. The resulting estimation problem is a challenging nonconvex mixed-integer nonlinear optimization problem. We investigate the validity of using reduced data sets by comparing how the lower and upper bounds change when replacing the full data set with different reduced data sets. We account for regions with high and low quality fits by considering the results for the whole feasible region and 100 different subregions. Our results indicate that both regions containing solution candidates and regions containing only low quality fits can be identified based on reduced data sets. Moreover, we observe that the average CPU time per branch-and-bound iteration typically decreases if reduced data sets are used.
- 9 May 2023
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 38 (6) , 1129-1141
Open AccessTowards global parameter estimation exploiting reduced data sets
We focus on deterministic global optimization (DGO) for nonconvex parameter estimation problems. Realistic and accurate solutions often require a fitting against very large measurement data sets, resulting in intractable size for DGO. Thus, we aim at accelerating the branch-and-bound algorithm by using reduced data sets for constructing valid bounds. We focus on fitting the equation of state for propane, which is of high interest for the chemical industry. The resulting estimation problem is a challenging nonconvex mixed-integer nonlinear optimization problem. We investigate the validity of using reduced data sets by comparing how the lower and upper bounds change when replacing the full data set with different reduced data sets. We account for regions with high and low quality fits by considering the results for the whole feasible region and 100 different subregions. Our results indicate that both regions containing solution candidates and regions containing only low quality fits can be identified based on reduced data sets. Moreover, we observe that the average CPU time per branch-and-bound iteration typically decreases if reduced data sets are used.