학술논문
An efficient algorithm for a certain class of robust optimization problems
Document Type
JOURNAL
Author
Source
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 2014, Vol. 33, Issue 4, pp. 1208-1219.
Subject
Language
English
ISSN
0332-1649
Abstract
– The purpose of this paper is to present an efficient method for the numerical treatment of robust optimization problems with absolute reliability constraints.
– Optimization with anti-optimization based on response surface techniques; polynomial chaos for approximation of the stochastic objective function.
– The number of function calls is comparable to that of the corresponding deterministic problem. Thus, the method is well suited for complex technical systems. The performance of the method is demonstrated on an optimal design problem for turbochargers.
– The highlights of this paper are: algorithms for robust and deterministic problems show comparable complexity; no derivatives required; good convergence properties because of special set up of optimization problem; application in complex industrial examples.
– Optimization with anti-optimization based on response surface techniques; polynomial chaos for approximation of the stochastic objective function.
– The number of function calls is comparable to that of the corresponding deterministic problem. Thus, the method is well suited for complex technical systems. The performance of the method is demonstrated on an optimal design problem for turbochargers.
– The highlights of this paper are: algorithms for robust and deterministic problems show comparable complexity; no derivatives required; good convergence properties because of special set up of optimization problem; application in complex industrial examples.