2 Millionen Bücher heute bestellen und morgen im Press & Books oder k kiosk abholen.
Merkliste
Die Merkliste ist leer.
Der Warenkorb ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

The Cross-Entropy Method

A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning
BuchKartoniert, Paperback
Verkaufsrang522390inEnglish Non Fiction A-Z
CHF189.00

Beschreibung

The cross-entropy (CE) method is one of the most significant developments in stochastic optimization and simulation in recent years. This book explains in detail how and why the CE method works. The CE method involves an iterative procedure where each iteration can be broken down into two phases: (a) generate a random data sample (trajectories, vectors, etc.) according to a specified mechanism; (b) update the parameters of the random mechanism based on this data in order to produce a ``better'' sample in the next iteration. The simplicity and versatility of the method is illustrated via a diverse collection of optimization and estimation problems.



The book is aimed at a broad audience of engineers, computer scientists, mathematicians, statisticians and in general anyone, theorist or practitioner, who is interested in fast simulation, including rare-event probability estimation, efficient combinatorial and continuous multi-extremal optimization, and machine learning algorithms.



Reuven Y. Rubinstein is the Milford Bohm Professor of Management at the Faculty of Industrial Engineering and Management at the Technion (Israel Institute of Technology). His primary areas of interest are stochastic modelling, applied probability, and simulation. He has written over 100 articles and has published five books. He is the pioneer of the well-known score-function and cross-entropy methods.



Dirk P. Kroese is an expert on the cross-entropy method. He has published close to 40 papers in a wide range of subjects in applied probability and simulation. He is on the editorial board of Methodology and Computing in Applied Probability and is Guest Editor of the Annals of Operations Research. He has held research and teaching positions at Princeton University and The University of Melbourne, and is currently working at the Department of Mathematics of The University of Queensland.

"Rarely have I seen such a dense and straight to the point pedagogical

monograph on such a modern subject. This excellent book, on the

simulated cross-entropy method (CEM) pioneered by one of the authors

(Rubinstein), is very well written..."

Computing Reviews, Stochastic Programming November, 2004

"It is a substantial contribution to stochastic optimization and more generally to the stochastic numerical methods theory." Short Book Reviews of the ISI, April 2005

"...I wholeheartedly recommend this book to anybody who is interested in stochastic optimization or simulation-based performance analysis of stochastic systems." Gazette of the Australian Mathematical Society, vol. 32 (3) 2005
Weitere Beschreibungen

Details

ISBN/GTIN978-1-4419-1940-3
ProduktartBuch
EinbandKartoniert, Paperback
Erscheinungsdatum12.12.2011
AuflageSoftcover reprint of the original 1st ed. 2004
Seiten301 Seiten
SpracheEnglisch
IllustrationenXX, 301 p. 60 illus., schwarz-weiss Illustrationen
Artikel-Nr.28023024
DetailwarengruppeEnglish Non Fiction A-Z
Weitere Details

Reihe

Autor

The cross-entropy (CE) method is one of the most significant developments in randomized optimization and simulation in recent years. This book explains in detail how and why the CE method works. The simplicity and versatility of the method is illustrated via a diverse collection of optimization and estimation problems. The book is aimed at a broad audience of engineers, computer scientists, mathematicians, statisticians and in general anyone, theorist and practitioner, who is interested in smart simulation, fast optimization, learning algorithms, and image processing.