Stochastic Adaptive Search for Global Optimization - Nonconvex Optimization and Its Applications - Z. B. Zabinsky - Boeken - Springer-Verlag New York Inc. - 9781461348269 - 20 november 2013
Indien omslag en titel niet overeenkomen, is de titel correct

Z. B. Zabinsky
Stochastic Adaptive Search for Global Optimization - Nonconvex Optimization and Its Applications Softcover Reprint of the Original 1st Ed. 2003 edition

Prijs
€ 97,99

Besteld in een afgelegen magazijn

Verwachte levering 5 - 13 nov.
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld
Ontvang meldingen over nieuwe releases van Z. B. Zabinsky

Onze klanten zeggen:

14 dagen retourrecht in overeenstemming met de Europese consumentenbeschermingswetgeving
Topnotering op Trustpilot
Voeg toe aan uw iMusic-verlanglijst

Nog niet beoordeeld

Publisher Marketing: The field of global optimization has been developing at a rapid pace. There is a journal devoted to the topic, as well as many publications and notable books discussing various aspects of global optimization. This book is intended to complement these other publications with a focus on stochastic methods for global optimization. Stochastic methods, such as simulated annealing and genetic algo- rithms, are gaining in popularity among practitioners and engineers be- they are relatively easy to program on a computer and may be cause applied to a broad class of global optimization problems. However, the theoretical performance of these stochastic methods is not well under- stood. In this book, an attempt is made to describe the theoretical prop- erties of several stochastic adaptive search methods. Such a theoretical understanding may allow us to better predict algorithm performance and ultimately design new and improved algorithms. This book consolidates a collection of papers on the analysis and de- velopment of stochastic adaptive search. The first chapter introduces random search algorithms. Chapters 2-5 describe the theoretical anal- ysis of a progression of algorithms. A main result is that the expected number of iterations for pure adaptive search is linear in dimension for a class of Lipschitz global optimization problems. Chapter 6 discusses algorithms, based on the Hit-and-Run sampling method, that have been developed to approximate the ideal performance of pure random search. The final chapter discusses several applications in engineering that use stochastic adaptive search methods.

Media Boeken     Paperback Book   (Boek met zachte kaft en gelijmde rug)
Vrijgegeven 20 november 2013
ISBN13 9781461348269
Uitgevers Springer-Verlag New York Inc.
Pagina's 224
Afmetingen 155 × 235 × 13 mm   ·   344 g
Taal en grammatica Engels  

Meer van dezelfde uitgever

Bekijk alles van Z. B. Zabinsky