4. Compute convex
lower bounding
function and
optimize it instead!

5. Convex bounding
function.

6. Convex bounding
function.
gap x

7. x

8. This interval
can not contain
the global minimum!

10. Requires tight
convex bounding
functions!

11. Requires tight
convex bounding
functions!
Even more important
in higher dimensions!

16. Obtaining an initial region

69. U u

73. U

76. Discussion Which approach is the winner? Branch Bound Global optimum
&
Global optimum
Generality
Problem size
Numerically stable