Deterministic Global Optimization
Geometric Branch-and-bound Methods and their Applications
- 156 pages
- 6 hours of reading
Geometric branch-and-bound methods are explored in depth, focusing on their applications in Lipschitzian optimization, d.c. programming, and interval analysis. The book introduces a novel concept for measuring the rate of convergence and provides a thorough analysis of various bounding operations documented in existing literature, enhancing the understanding of these optimization techniques.
