J. González Díaz, B. González Rodríguez, P. Belotti, I. Rodríguez Acevedo, I. Gómez Casares
This talk aims to showcase the latest developments in RAPOSa, a global solver for polynomial optimization problems, with a primary focus on its two most recent functionalities: i) the extension to solve mixed-integer MINLP problems and ii) the extension to solve problems on unbounded domains. With the inclusion of these two extensions, RAPOSa can now tackle any MINLP polynomial optimization problem and, eventually, solve it to certified global optimality.
The talk will delve into various facets of the key challenges encountered in these extensions, including some unexpected findings related to the impact of seemingly innocuous modeling choices.
Palabras clave: Optimización polinómica, diseño de algoritmos, optimización global
Programado
Optimización Entera y Combinatoria
10 de junio de 2025 17:10
MR 3