Skip navigation
  •  Inicio
  • UDC 
    • Cómo depositar
    • Políticas do RUC
    • FAQ
    • Dereitos de Autor
    • Máis información en INFOguías UDC
  • Percorrer 
    • Comunidades
    • Buscar por:
    • Data de publicación
    • Autor
    • Título
    • Materia
  • Axuda
    • español
    • Gallegan
    • English
  • Acceder
  •  Galego 
    • Español
    • Galego
    • English
  
Ver ítem 
  •   RUC
  • Facultade de Informática
  • Investigación (FIC)
  • Ver ítem
  •   RUC
  • Facultade de Informática
  • Investigación (FIC)
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
Ver/abrir
GonzalezRodriguez_2022_Computational_Advanes_Polynomial_Optimization_RAPOSa.pdf (3.179Mb)
Use este enlace para citar
http://hdl.handle.net/2183/32267
Atribución 3.0 España
A non ser que se indique outra cousa, a licenza do ítem descríbese como Atribución 3.0 España
Coleccións
  • Investigación (FIC) [1710]
Metadatos
Mostrar o rexistro completo do ítem
Título
Computational advances in polynomial optimization: RAPOSa, a freely available global solver
Autor(es)
González Rodríguez, Brais
Ossorio-Castillo, Joaquin
González-Díaz, Julio
González Rueda, Ángel Manuel
Penas, David R.
Rodríguez-Martínez, Diego
Data
2022-09
Cita bibliográfica
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
Resumo
[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 chave
Global optimization
Polynomial programming
Reformulation-Linearization Technique (RLT )
 
Versión do editor
https://doi.org/10.1007/s10898-022-01229-w
Dereitos
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
 

Listar

Todo RUCComunidades e colecciónsPor data de publicaciónAutoresTítulosMateriasGrupo de InvestigaciónTitulaciónEsta colecciónPor data de publicaciónAutoresTítulosMateriasGrupo de InvestigaciónTitulación

A miña conta

AccederRexistro

Estatísticas

Ver Estatísticas de uso
Sherpa
OpenArchives
OAIster
Scholar Google
UNIVERSIDADE DA CORUÑA. Servizo de Biblioteca.    DSpace Software Copyright © 2002-2013 Duraspace - Suxestións