2013
DOI: 10.1016/b978-0-444-53859-8.00003-5
|View full text |Cite
|
Sign up to set email alerts
|

The Cross-Entropy Method for Optimization

Abstract: The cross-entropy method is a versatile heuristic tool for solving difficult estimation and optimization problems, based on Kullback-Leibler (or cross-entropy) minimization. As an optimization method it unifies many existing populationbased optimization heuristics. In this chapter we show how the cross-entropy method can be applied to a diverse range of combinatorial, continuous, and noisy optimization problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
100
0
1

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 157 publications
(101 citation statements)
references
References 38 publications
0
100
0
1
Order By: Relevance
“…The CE method has been successfully applied to many complicated integer non-linear programming and continuous multi-extremal optimization (see, for example, [20]). In this section we describe how the method can be used to determine pertinent (meaningful) Laguerre generators.…”
Section: Ce Methods For Inverting La-guerre Tessellationsmentioning
confidence: 99%
“…The CE method has been successfully applied to many complicated integer non-linear programming and continuous multi-extremal optimization (see, for example, [20]). In this section we describe how the method can be used to determine pertinent (meaningful) Laguerre generators.…”
Section: Ce Methods For Inverting La-guerre Tessellationsmentioning
confidence: 99%
“…The corresponding RO implementations are often characterized by noisy objective functions due to the numerical noise associated with sampling-based failure probability estimates. Consequently, the solution to the RO problem often relies on the implementation of a global optimization algorithm (e.g., Genetic Algorithm [44], Crossentropy [7]), while the solution to the RBDO problem can be found through numerically more efficient nonlinear programming algorithms (e.g., [40]). A relatively straightforward solution to RO and RBDO problems is obtained by nesting a reliability algorithm within an optimization algorithm in a socalled 'double-loop' formulation.…”
Section: Short Literature Reviewmentioning
confidence: 99%
“…The CE method is a heuristic approach for estimating rare events and solving optimizations problems [14,7]. The method was initially developed as an adaptive importance sampling method for the estimation of rare-event probabilities by minimizing the cross-entropy or Kullback-Liebler divergence as a measure of distance between two distributions.…”
Section: Line Samplingmentioning
confidence: 99%
“…The present paper is based on the stochastic search algorithm known as the cross-entropy method (CEM) whose efficiency has been observed in several works. The proposed algorithm given in Table 1 is derived from the one proposed for continuous optimization in [19] based on sampling with normal distributions.…”
Section: Selection Of the Svr Surrogate Model Parametersmentioning
confidence: 99%
“…, s max , is constructed in the standard space with training points which get closer to the failure domain F u with iteration s. The new training points at each iteration s are generated from the currently constructed SVR surrogate model G s by means of Monte Carlo Markov chains (MCMC). A new SVR surrogate is trained at each iterations s. Optimal values for its hyperparameters are accurately determined by minimization of an estimate of the leaveone-out (LOO) error proposed by Chang and Lin [18] using the cross-entropy (CE) method [19]. The approximation of the failure probability p f is evaluated from the SVR surrogate G smax trained at the final iteration.…”
Section: Introductionmentioning
confidence: 99%