Session: Recent Adavances in Interval Arithmetic based Methods
Chair: Frederic Messine
Cluster: Global Optimization
Talk 1: Boosting the performance of rigorous global optimization
Speaker: Victor Reyes Rodriguez
Abstract: In this talk, I will present some boosting methods to improve the performance of rigorous global optimization.
Talk 2: Node selection through upper bounding local search methods in branch & bound solvers for NCOPs
Speaker: Ignacio Araya
Abstract: In this talk, I will present how to improve the convergence of branch & bound solvers for NCOPs by making node selection through upper bounding local search methods.
Talk 3: Interval Branch and Bound Code with PDE-constraints
Speaker: Frédéric Messine
Abstract: In this article, I will show how, in a global optimization solver whose bound calculations are performed by interval arithmetic, we can insert constraints based on numerical simulations. The aim of this extension is to provide exact solutions to concrete complex problems: an example will be given for the design of electric motors.
