.png){kind=icon}
.png){kind=icon}
Return
Adaptive pattern search for large-scale optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-017-0901-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The emergence of high-dimensional data requires the design of new optimization methods. Indeed, conventional optimization methods require improvements, hybridization, or parameter tuning in order to operate in spaces of high dimensions. In this paper, we present a new adaptive variant of a pattern search algorithm to solve global optimization problems exhibiting such a character. The proposed method has no parameters visible to the user and the default settings, determined by almost no a priori experimentation, are highly robust on the tested datasets. The algorithm is evaluated and compared with 11 state-of-the-art methods on 20 benchmark functions of 1000 dimensions from the CEC'2010 competition. The results show that this approach obtains good performances compared to the other methods tested.
Keywords:
Pattern search
Scatter search
Optimization
Continuous
High-dimension
Large-scale
Adaptive methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.5K
Citations:
1.7W
View more organizations