Name
Abstract | ||
|---|---|---|
We propose a global optimization algorithm based on the sequential Monte Carlo (SMC) sampling framework. In this framework, the objective function is normalized to be a probabilistic density function (pdf), based on which a sequence of annealed target pdfs is designed to asymptotically converge on the set of global optimum. A sequential importance sampling procedure is performed to simulate the resulting targets and the maxima of the objective function are assessed from the yielded samples. The disturbing issue lies in the design of the importance sampling (IS) pdf, which crucially influences the IS efficiency. We propose an approach to design the IS pdf by embedding a posterior exploration (PE) procedure into each iteration of the SMC framework. The PE procedure can explore the important regions of the solution space supported by the target pdf. A byproduct of the PE procedure is an adaptive mechanism to design the annealing temperature schedule. We compare the proposed algorithm with related existing methods using a dozen benchmark functions. The result demonstrates the appealing properties of our algorithm. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s10898-017-0543-8 | J. Global Optimization |
Keywords | Field | DocType |
Global optimization,Sequential Monte Carlo,Adaptive annealing schedule,Mixture model,Particle filter optimization,Student’s,t,distribution,Expectation-maximization | Importance sampling,Mathematical optimization,Normalization (statistics),Embedding,Global optimization,Particle filter,Sampling (statistics),Probabilistic logic,Statistics,Probability density function,Mathematics | Journal |
Volume | Issue | ISSN |
69 | 4 | 0925-5001 |
Citations | PageRank | References |
1 | 0.36 | 12 |
Authors | ||
1 | ||