Audet / Hare

Derivative-Free and Blackbox Optimization

Springer International Publishing

ISBN 978-3-319-68913-5

Standardpreis


69,54 €

sofort lieferbar!

Preisangaben inkl. MwSt. Abhängig von der Lieferadresse kann die MwSt. an der Kasse variieren. Weitere Informationen

Bibliografische Daten

eBook. PDF. Weiches DRM (Wasserzeichen)

2017

38 s/w-Abbildungen.

In englischer Sprache

Umfang: 302 S.

Verlag: Springer International Publishing

ISBN: 978-3-319-68913-5

Produktbeschreibung

Flexible usage suitable for undergraduate, graduate, mathematics, computer science, engineering, or mixed classes 15 end-of-chapter projects are provided, allowing advanced exploration of desired topics Includes numerous exercises throughout to test knowledge and advance understanding
This book is designed as a textbook, suitable for self-learning or for teaching an upper-year university course on derivative-free and blackbox optimization. The book is split into 5 parts and is designed to be modular; any individual part depends only on the material in Part I. Part I of the book discusses what is meant by Derivative-Free and Blackbox Optimization, provides background material, and early basics while Part II focuses on heuristic methods (Genetic Algorithms and Nelder-Mead). Part III presents direct search methods (Generalized Pattern Search and Mesh Adaptive Direct Search) and Part IV focuses on model-based methods (Simplex Gradient and Trust Region). Part V discusses dealing with constraints, using surrogates, and bi-objective optimization. End of chapter exercises are included throughout as well as 15 end of chapter projects and over 40 figures. Benchmarking techniques are also presented in the appendix.

Autorinnen und Autoren

Produktsicherheit

Hersteller

Springer Nature Customer Service Center GmbH

ProductSafety@springernature.com

Topseller & Empfehlungen für Sie

Ihre zuletzt angesehenen Produkte

Rezensionen

Dieses Set enthält folgende Produkte:
    Auch in folgendem Set erhältlich:

    • nach oben

      Ihre Daten werden geladen ...