Computational advances in polynomial optimization: RAPOSa, a freely available global solver

González-Rodríguez, B., Ossorio-Castillo, J., González-Díaz, J. et al. Computational advances in polynomial optimization: RAPOSa, a freely available global solver. J Glob Optim (2022). https://doi.org/10.1007/s10898-022-01229-w

Resumen

[Abstract]: In this paper we introduce RAPOSa, a global optimization solver specifically designed for (continuous) polynomial programming problems with box-constrained variables. Written entirely in C++, RAPOSa is based on the Reformulation-Linearization (Sherali and Tuncbilek in J Glob Optim 103:225–249, 1992). We present a description of the main characteristics of RAPOSa along with a thorough analysis of the impact on its performance of various enhancements discussed in the literature, such as bound tightening and SDP cuts. We also present a comparative study with three of the main state-of-the-art global optimization solvers: BARON, Couenne and SCIP.

Palabras clave

Global optimization
Polynomial programming
Reformulation-Linearization Technique (RLT )

Versión del editor

https://doi.org/10.1007/s10898-022-01229-w

Derechos

Atribución 3.0 España

This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

ISSN

0925-5001
1573-2916