ISBN-13: 9783662662397 / Angielski / Twarda / 2024 / 168 str.
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 it develops in detail the ideas of branch-and-bound methods.
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 it develops in detail the ideas of branch-and-bound methods.