Efficient global robust optimization of unconstrained problems affected by parametric uncertainties

22Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A novel technique for efficient global robust optimization of problems affected by parametric uncertainties is proposed. The method is especially relevant to problems that are based on expensive computer simulations. The globally robust optimal design is obtained by searching for the best worst-case cost, which involves a nested min-max optimization problem. In order to reduce the number of expensive function evaluations, we fit response surfaces using Kriging and use adapted versions of expected improvement to direct the search for the robust optimum. The numerical performance of the algorithm is compared against other techniques for min-max optimization on established test problems. The proposed approach exhibits reliable convergence, is more efficient than previous methods and shows strong scalability.

Cite

CITATION STYLE

APA

ur Rehman, S., & Langelaar, M. (2015). Efficient global robust optimization of unconstrained problems affected by parametric uncertainties. Structural and Multidisciplinary Optimization, 52(2), 319–336. https://doi.org/10.1007/s00158-015-1236-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free