.png){kind=icon}
.png){kind=icon}
Return
A peak-over-threshold search method for global optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2017.12.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a random search method, called peak-over-threshold search (POTS), for solving global optimization problems. An important feature of POTS is that it combines the existing partition based random search framework (e.g., Shi and Olafsson 2000a: Chen et al. 2011) with the peak-over threshold statistical reference (Coles, 2001) in order to achieve high search efficiency. In each iteration, POTS partitions the solution space into several subregions, evaluates the quality of each subregion and moves to promising subregions for more partitioning and sampling. To effectively assess the quality of a subregion, an extreme value type of inference in statistics is used to develop a new promising index which reflects the optimal objective value of a subregion and biases the search to regions that are likely to contain the optimal or near-optimal solutions. Under assumptions on the depth of partitioning and the probability of correct movement, POTS is shown to converge with probability one to the optimal region. The higher efficiency of the proposed method is illustrated by numerical examples. The application of POTS to beam angle selection, an important optimization problem in radiation treatment, is also presented in this paper. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Partition-based random search
Global optimization
Extreme value analysis
Meta heuristic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
View more organizations