期刊
ENGINEERING OPTIMIZATION
卷 44, 期 5, 页码 537-550出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2011.598520
关键词
constrained optimization; simplex search algorithm; constraint handling
In this article, a robust method is presented for handling constraints with the Nelder and Mead simplex search method, which is a direct search algorithm for multidimensional unconstrained optimization. The proposed method is free from the limitations of previous attempts that demand the initial simplex to be feasible or a projection of infeasible points to the nonlinear constraint boundaries. The method is tested on several benchmark problems and the results are compared with various evolutionary algorithms available in the literature. The proposed method is found to be competitive with respect to the existing algorithms in terms of effectiveness and efficiency.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据