摘要

The stochastic subset optimization (SSO) algorithm has been recently proposed for design problems that use the system reliability as objective function. It is based on simulation of samples of the design variables from an auxiliary probability density function, and uses this information to identify subsets for the optimal solution. This paper presents an extension, termed Non-Parametric SSO, that adopts kernel density estimation (KDE) to approximate the objective function through these samples. It then uses this approximation to identify candidate points for the global minimum. To reduce the computational effort an iterative approach is established whereas efficient reflection methodologies are implemented for the KDE.

  • 出版日期2013-9-15

全文