.png){kind=icon}
返回
Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.10.020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The class of generalized pattern search (GPS) algorithms for mixed variable optimization is extended to problems with stochastic objective functions. Because random noise in the objective function makes it more difficult to compare trial points and ascertain which points are truly better than others, replications are needed to generate sufficient statistical power to draw conclusions. Rather than comparing pairs of points, the approach taken here augments pattern search with a ranking and selection (R&S) procedure, which allows for comparing many function values simultaneously. Asymptotic convergence for the algorithm is established, numerical issues are discussed, and performance of the algorithm is studied on a set of test problems. Published by Elsevier B.V.
Keyword:
Pattern search algorithms
Mixed variable programming
Nonlinear programming
Simulation
Ranking and selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Complex regulation of the TaMyc1 gene expression in wheat grain synthesizing anthocyanin pigments
.png){kind=icon}
PREAI
分享收藏
查看更多内容