A Fast Robust Optimization Methodology based on Polynomial Chaos and Evolutionary Algorithm for Inverse Problems

摘要

This paper explores the potential of polynomial chaos in robust designs of inverse problems. To this end, a fast numerical methodology based on combinations of polynomial chaos expansion and evolutionary algorithm is proposed. The numerical results on two case studies are reported to illustrate the feasibility and advantage of the present work.