Show simple item record

contributor authorKoullias, Stefanos
contributor authorMavris, Dimitri N.
date accessioned2017-05-09T01:10:36Z
date available2017-05-09T01:10:36Z
date issued2014
identifier issn1050-0472
identifier othermd_136_08_081007.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/155661
description abstractThe design of unconventional systems requires early use of highfidelity physicsbased tools to search the design space for improved and potentially optimum designs. Current methods for incorporating these computationally expensive tools into early design for the purpose of reducing uncertainty are inadequate due to the limited computational resources that are available in early design. Furthermore, the lack of finite difference derivatives, unknown design space properties, and the possibility of code failures motivates the need for a robust and efficient global optimization (EGO) algorithm. A novel surrogate modelbased global optimization algorithm capable of efficiently searching challenging design spaces for improved designs is presented. The algorithm, called fBcEGO for fully Bayesian constrained EGO, constructs a fully Bayesian Gaussian process (GP) model through a set of observations and then uses the model to make new observations in promising areas where improvements are likely to occur. This model remedies the inadequacies of likelihoodbased approaches, which may provide an incomplete inference of the underlying function when function evaluations are expensive and therefore scarce. A challenge in the construction of the fully Bayesian GP model is the selection of the prior distribution placed on the model hyperparameters. Previous work employs static priors, which may not capture a sufficient number of interpretations of the data to make any useful inferences about the underlying function. An iterative method that dynamically assigns hyperparameter priors by exploiting the mechanics of Bayesian penalization is presented. fBcEGO is incorporated into a methodology that generates relatively few infeasible designs and provides large reductions in the objective function values of design problems. This new algorithm, upon implementation, was found to solve more nonlinearly constrained algebraic test problems to higher accuracies relative to the global minimum than other popular surrogate modelbased global optimization algorithms and obtained the largest reduction in the takeoff gross weight objective function for the case study of a notional 70passenger regional jet when compared with competing design methods.
publisherThe American Society of Mechanical Engineers (ASME)
titleMethodology for Global Optimization of Computationally Expensive Design Problems
typeJournal Paper
journal volume136
journal issue8
journal titleJournal of Mechanical Design
identifier doi10.1115/1.4027493
journal fristpage81007
journal lastpage81007
identifier eissn1528-9001
treeJournal of Mechanical Design:;2014:;volume( 136 ):;issue: 008
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record