439. Solving MINLP polynomial problems to global optimality: Recent advances in RAPOSa
Invited abstract in session TA-43: Global and Nonlinear Solvers, stream Software for Optimization.
Tuesday, 8:30-10:00Room: Newlyn GR.07
Authors (first author is the speaker)
| 1. | Julio González-Díaz
|
| Statistics, Mathematical Analysis and Optimization, University of Santiago de Compostela | |
| 2. | Brais González Rodríguez
|
| University of Vigo | |
| 3. | Pietro Belotti
|
| Electronics, Information and Bioengineering, Politecnico di Milano | |
| 4. | Iria Rodríguez-Acevedo
|
| University of Santiago de Compostela | |
| 5. | Ignacio Gómez-Casares
|
| Department of Statistics, Mathematical Analysis and Optimization, University of Santiago de Compostela |
Abstract
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.
Keywords
- Software
- Global Optimization
- Programming, Nonlinear
Status: accepted
Back to the list of papers