Global Optimization : Theory, Algorithms, and Applications

Contains a thorough overview of the rapidly growing field of global optimization, with chapters on key topics such as complexity, heuristic methods, derivation of lower bounds for minimization problems, and branch-and-bound methods and convergence.

The final chapter offers both benchmark test problems and applications of global optimization, such as finding the conformation of a molecule or planning an optimal trajectory for interplanetary space travel.

An appendix provides fundamental information on convex and concave functions.