Basic Concepts of Global Optimization

This textbook is an introduction to global optimization, which treats mathematical facts stringently on the one hand, but also motivates them in great detail and illustrates them with 80 figures. The book is therefore not only aimed at mathematicians, but also at natural scientists, engineers and economists who want to understand and apply mathematically sound methods in their field.

With almost two hundred pages, the book provides enough choices to use it as a basis for differently designed lectures on global optimization. The detailed treatment of the global solvability of optimization problems under application-relevant conditions sets a new accent that enriches the stock of previous textbooks on optimization. Using the theory and algorithms of smooth convex optimization, the book illustrates that the global solution of a class of optimization problems frequently encountered in practice is efficiently possible, while for the more difficult-to-handle non-convex problems itdevelops in detail the ideas of branch-and-bound methods.

This book is the English translation of the 2nd edition of Grundzüge der Globalen Optimierung (Springer, 2021) written in German. The translation was done with the help of artificial intelligence. A subsequent revision was performed by the author to further refine the work and to ensure that the translation is appropriate concerning content and scientific correctness. It may, however, read stylistically different from a conventional translation.

A comprehensive introduction to global optimization With many examples in the theory and application Doesn't require deep knowledege in mathematics

Auteur

Prof. Dr. Oliver Stein is a full professor at the Karlsruhe Institute of Technology, where he heads the Continuous Optimization group at the Institute for Operations Research. His research focuses on the design and implementation of optimization methods and their theoretical foundations. His teaching focuses on global optimization, nonlinear optimization, mixed-integer optimization, convex analysis, parametric optimization, and multiobjective optimization.

Contenu

1 Introduction.- 2 Convex Optimization Problems.- 3 Nonconvex Optimization Problems.