Janina Schreiber
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Janina Schreiber has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Christine Zarges
Aberystwyth University
1 shared publication - Damar Wicaksono
Center for Advanced Systems Understanding (CASUS) - Helmholtz-Zentrum Dresden-Rossendorf (HZDR), Germany
1 shared publication - Frank Neumann
Adelaide University
1 shared publication - Joshua Knowles
SLB Cambridge Research, Cambridge, UK
1 shared publication - Michael Hecht
Center for Advanced Systems Understanding (CASUS) -Helmholtz-Zentrum Dresden-Rossendorf (HZDR) Untermarkt 20 02826 Görlitz Germany
1 shared publication - Per Kristian Lehre
University of Birmingham, Birmingham, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1340-1348
A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1340-1348
Open AccessA Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 759-762
Minimizing Black Boxes due to Polynomial-Model-Based Optimization
We introduce a novel black box optimization method, which we term Polynomial-Model-Based Optimization (PMBO). The main idea of this algorithm originates from Bayesian Optimization (BO) [16], however, instead of inferring a stochastic process, a polynomial surrogate of the objective function is fitted and exploited in the regions where the objective is expected to minimize. We compare PMBO with state-of-the-art optimization algorithms for common test functions and a real-world optimization problem. The results demonstrate PMBO to be capable of inferring the inherent structure of the objective function, resulting in its efficiency. This suggests that PMBO might be the pivotal choice for the optimization of highly structured real-world problems.
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 759-762
Open AccessMinimizing Black Boxes due to Polynomial-Model-Based Optimization
We introduce a novel black box optimization method, which we term Polynomial-Model-Based Optimization (PMBO). The main idea of this algorithm originates from Bayesian Optimization (BO) [16], however, instead of inferring a stochastic process, a polynomial surrogate of the objective function is fitted and exploited in the regions where the objective is expected to minimize. We compare PMBO with state-of-the-art optimization algorithms for common test functions and a real-world optimization problem. The results demonstrate PMBO to be capable of inferring the inherent structure of the objective function, resulting in its efficiency. This suggests that PMBO might be the pivotal choice for the optimization of highly structured real-world problems.