RT Journal Article
T1 Computational advances in polynomial optimization: RAPOSa, a freely available global solver
A1 González Rodríguez, Brais
A1 Ossorio Castillo, Joaquín
A1 González Díaz, Julio
A1 González Rueda, Ángel Manuel
A1 Rodríguez Penas, David
K1 Global optimization
K1 Polynomial programming
K1 Reformulation-Linearization Technique (RLT)
AB 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
PB Springer
SN 0925-5001
YR 2022
FD 2022
LK http://hdl.handle.net/10347/29971
UL http://hdl.handle.net/10347/29971
LA eng
NO 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
NO This research has been funded by FEDER and the Spanish Ministry of Science and Technology through Projects MTM2014-60191-JIN, MTM2017-87197-C3 (1-P and 3-P) and PID2021-124030NB-C32. Brais González-Rodríguez acknowledges support from the Spanish Ministry of Education through FPU Grant 17/02643. David R. Penas’ research is funded by the Xunta de Galicia (post-doctoral contract 2019-2022). Ángel M. González-Rueda acknowledges support from the Xunta de Galicia through the ERDF (ED431C-2020-14 and ED431G 2019/01) and “CITIC”. Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
DS Minerva
RD 22 abr 2026