Uncertainty Based Optimization Strategy for the Gappy-POD Multi-Fidelity Method

Author(s):  
Bernhard Poethke ◽  
Stefan Völker ◽  
Konrad Vogeler

Abstract In the surrogate model-based optimization of turbine airfoils, often only the prediction values for objective and constraints are employed, without considering uncertainties in the prediction. This is also the case for multi-fidelity optimization strategies based on e.g. the Gappy-POD approach, in which results from analyses of different fidelities are incorporated. However, the consideration of uncertainties in global optimization has the advantage that a balanced coverage of the design space between unexplored regions and regions close to the current optimum takes place. This means that on the one hand regions are covered in which so far only a few sample points are present and thus a high degree of uncertainty exists (global exploration), and on the other hand regions with promising objective and constraint values are investigated (local exploitation). The genuine new contribution in this work is the quantification of the uncertainty of the multi-fidelity Gappy-POD method and an adapted optimization strategy based on it. The uncertainty quantification is based on the error of linear fitting of low-fidelity values to the POD basis and subsequent forward propagation to the high-fidelity values. The uncertainty quantification is validated for random airfoil designs in a design of experiment. Based on this, a global optimization strategy for constrained problems is presented, which is based on the well-known Efficient Global Optimization (EGO) strategy and the Feasible Expected Improvement criterion. This means that Kriging models are created for both the objective and the constraint values depending on the design variables that consider both the predictions and the uncertainties. This approach offers the advantage that existing and widely used programs or libraries can be used for multi-fidelity optimization that support the (single-fidelity) EGO algorithm. Finally, the method is demonstrated for an industrial test case. A comparison between a single-fidelity optimization and a multi-fidelity optimization is made, each with the EGO strategy. A coupling of 2D/3D simulations is used for multi-fidelity analyses. The proposed method achieves faster feasible members in the optimization, resulting in faster turn-around compared to the single-fidelity strategy.

Author(s):  
Long Wang ◽  
Theodore T. Allen ◽  
Michael A. Groeber

AbstractMethods based on Gaussian stochastic process (GSP) models and expected improvement (EI) functions have been promising for box-constrained expensive optimization problems. These include robust design problems with environmental variables having set-type constraints. However, the methods that combine GSP and EI sub-optimizations suffer from the following problem, which limits their computational performance. Efficient global optimization (EGO) methods often repeat the same or nearly the same experimental points. We present a novel EGO-type constraint-handling method that maintains a so-called tabu list to avoid past points. Our method includes two types of penalties for the key “infill” optimization, which selects the next test runs. We benchmark our tabu EGO algorithm with five alternative approaches, including DIRECT methods using nine test problems and two engineering examples. The engineering examples are based on additive manufacturing process parameter optimization informed using point-based thermal simulations and robust-type quality constraints. Our test problems span unconstrained, simply constrained, and robust constrained problems. The comparative results imply that tabu EGO offers very promising computational performance for all types of black-box optimization in terms of convergence speed and the quality of the final solution.


Author(s):  
Jack P. C. Kleijnen ◽  
Wim C. M. van Beers ◽  
Inneke Van Nieuwenhuyse

2011 ◽  
Vol 54 (1) ◽  
pp. 59-73 ◽  
Author(s):  
Jack P. C. Kleijnen ◽  
Wim van Beers ◽  
Inneke van Nieuwenhuyse

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Rajitha Meka ◽  
Adel Alaeddini ◽  
Chinonso Ovuegbe ◽  
Pranav Bhounsule ◽  
Peyman Najafirad ◽  
...  

2018 ◽  
Vol 140 (6) ◽  
Author(s):  
Alexandru-Ciprian Zăvoianu ◽  
Susanne Saminger-Platz ◽  
Doris Entner ◽  
Thorsten Prante ◽  
Michael Hellwig ◽  
...  

We present an effective optimization strategy that is capable of discovering high-quality cost-optimal solution for two-dimensional (2D) path network layouts (i.e., groups of obstacle-avoiding Euclidean Steiner trees) that, among other applications, can serve as templates for complete ascent assembly structures (CAA-structures). The main innovative aspect of our approach is that our aim is not restricted to simply synthesizing optimal assembly designs with regard to a given goal, but we also strive to discover the best tradeoffs between geometric and domain-dependent optimal designs. As such, the proposed approach is centered on a variably constrained multi-objective formulation of the optimal design task and on an efficient coevolutionary solver. The results we obtained on both artificial problems and realistic design scenarios based on an industrial test case empirically support the value of our contribution to the fields of optimal obstacle-avoiding path generation in particular and design automation in general.


2019 ◽  
Author(s):  
Jon Paul Janet ◽  
Sahasrajit Ramesh ◽  
Chenru Duan ◽  
Heather Kulik

<p>The accelerated discovery of materials for real world applications requires the achievement of multiple design objectives. Satisfaction of such constraints requires exploration of multi-million compound libraries over which even density-functional theory (DFT) screening is intractable. Machine learning (ML, e.g., artificial neural network, ANN, or Gaussian process, GP) models for this task are limited by training data availability and predictive uncertainty quantification (UQ). We overcome such limitations by using efficient global optimization (EGO) with the multi-dimensional expected improvement (EI) criterion. EGO balances exploitation of a trained model with acquisition of new DFT data at the Pareto front, the region of chemical space that contains the optimal trade-off between multiple design criteria. We demonstrate this approach for the simultaneous optimization of redox potential and solubility in candidate M(II)/M(III) redox couples for redox flow batteries from a space of 2.8M transition metal complexes designed for stability in practical RFB applications. We employ latent-distance-based UQ with a multi-task ANN to enable model generalization that surpasses that of a GP. With this approach, ANN prediction and EI scoring of the full 2.8M complex space is achieved in minutes. Starting from ca. 100 representative points, EGO improves both properties by 3-4 standard deviations in only five generations. Analysis of lookahead errors confirms rapid ANN model improvement during the EGO process, achieving suitable accuracy for predictive design in the space of transition metal complexes. The ANN-driven EI approach achieves at least 500-fold acceleration over random search, identifying a Pareto-optimal design in around five weeks instead of fifty years.<br></p>


Sign in / Sign up

Export Citation Format

Share Document