Detalle de: Computational advances in polynomial optimization: RAPOSa, a freely available global solver
| Title | Computational advances in polynomial optimization: RAPOSa, a freely available global solver |
| Abstract |
In this paper we introduce , a global optimization solver specifically designed for (continuous) polynomial programming problems with box-constrained variables. Written entirely in , 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 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: , and . |
| Apa Reference | González-Rodríguez, B., Ossorio-Castillo, J., González-Díaz, J., González-Rueda, Á.M., Penas, D.R. & Rodríguez-Martínez, D. (2022). Computational advances in polynomial optimization: RAPOSa, a freely available global solver. Journal of Global Optimization, 85(3), 541-568. 10.1007/s10898-022-01229-w |
| Doi | 10.1007/s10898-022-01229-w |
| Publication Date | 29 Sep 2022 |
| Publication Type | Article |
| Researcher | David Rodríguez Penas |
| Ontology | Mathematical optimization |
| Research Groups | |
| Tools |