.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Computationally expensive optimization
divide-and-conquer (DC)
evolutionary algorithms (EAs)
high-dimensional optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
Cited Papers
ShareSaveTranscranial direct current stimulation on prefrontal and parietal areas enhances motor imagery.png)
NeuroReport
NeuroReportIF0
PREAI
ShareSave
ShareSave
View more