MACIS 2015 Session (SS12): Global Optimization

MACIS 2015: Home, Sessions Page


Aim and Scope

Since about thirty years, the Branch and Bound algorithms are increasingly used to solve non-convex global optimization problems in a deterministic and reliable way. However, these methods may require much CPU time, thus acceleration methods are generally essential.
This session will focus on different techniques based on interval analysis, constraint programming techniques, linear relaxations or semidefinite relaxations, to improve and accelerate the converge of these algorithms.

Topics (including, but not limited to)


Submission Guidelines