.png){kind=icon}
返回
Turning High-Dimensional Optimization Into Computationally Expensive Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2017.2672689.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Divide-and-conquer (DC) is conceptually well suited to deal with high-dimensional optimization problems by decomposing the original problem into multiple low-dimensional subproblems, and tackling them separately. Nevertheless, the dimensionality mismatch between the original problem and subproblems makes it nontrivial to precisely assess the quality of a candidate solution to a subproblem, which has been a major hurdle for applying the idea of DC to nonseparable high-dimensional optimization problems. In this paper, we suggest that searching a good solution to a subproblem can be viewed as a computationally expensive problem and can be addressed with the aid of meta-models. As a result, a novel approach, namely self-evaluation evolution (SEE) is proposed. Empirical studies have shown the advantages of SEE over four representative compared algorithms increase with the problem size on the CEC2010 large scale global optimization benchmark. The weakness of SEE is also analyzed in the empirical studies.
Keyword:
Computationally expensive optimization
divide-and-conquer (DC)
evolutionary algorithms (EAs)
high-dimensional optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
引用论文
分享收藏Transcranial direct current stimulation on prefrontal and parietal areas enhances motor imagery.png)
NeuroReport
NeuroReportIF0
PREAI
分享收藏Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization面向大规模优化的差分分组协同进化算法
OAAI
OAAI分享收藏
查看更多内容