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

DOI10.1007/S10898-022-01229-WOpenAlexW4297521456MaRDI QIDQ2689854

Julio González-Díaz, David R. Penas, Joaquín Ossorio-Castillo, Brais González-Rodríguez, Diego Rodríguez-Martínez, Ángel M. González Rueda

Publication date: 14 March 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01229-w

zbMATH Keywords

global optimizationpolynomial programmingreformulation-linearization technique (RLT)

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (2)

nlopt ⋮ RAPOSa

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• AMPL
• lp_solve
• Gurobi
• lpSolve
• SparsePOP
• Couenne
• Ipopt
• Pyomo
• CLP
• MINLPLib
• OR-tools
• RLT-POS

Cites Work

• Unnamed Item
• A Modeling Language for Mathematical Programming
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
• Reduced RLT representations for nonconvex polynomial programming problems
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
• Three enhancements for optimization-based bound tightening
• Domain reduction techniques for global NLP and MINLP optimization
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Branching rules revisited
• Bound reduction using pairs of linear inequalities
• On learning and branching: a survey
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Feasibility-Based Bounds Tightening via Fixed Points
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Branching and bounds tighteningtechniques for non-convex MINLP
• Large-scale linearly constrained optimization
• A Note on Performance Profiles for Benchmarking Software
• Pyomo — Optimization Modeling in Python
• Benchmarking optimization software with performance profiles.

This page was built for publication: Computational advances in polynomial optimization: RAPOSa, a freely available global solver