ISSN:
1387-5841
Keywords:
combinatorial optimization
;
global optimization
;
importance sampling
;
markov chain monte carlo
;
simulated annealing
;
simulation
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We present a new and fast method, called the cross-entropy method, for finding the optimal solution of combinatorial and continuous nonconvex optimization problems with convex bounded domains. To find the optimal solution we solve a sequence of simple auxiliary smooth optimization problems based on Kullback-Leibler cross-entropy, importance sampling, Markov chain and Boltzmann distribution. We use importance sampling as an important ingredient for adaptive adjustment of the temperature in the Boltzmann distribution and use Kullback-Leibler cross-entropy to find the optimal solution. In fact, we use the mode of a unimodal importance sampling distribution, like the mode of beta distribution, as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization. In the later case we show almost surely convergence of our algorithm to the optimal solution. Supporting numerical results for both continuous and combinatorial optimization problems are given as well. Our empirical studies suggest that the cross-entropy method has polynomial in the size of the problem running time complexity.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1010091220143
