1 citations · 1 across the 4 of their papers we have counts for
4 papers
Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
Julio González-Díaz, Brais González-Rodríguez, Ignacio Gómez-Casares
In this paper we explore a relevant aspect of the interplay between two core elements of global optimization algorithms for nonconvex nonlinear programming problems, which we belie…
Learning in Spatial Branching: Limitations of Strong Branching Imitation
Brais González-Rodríguez, Ignacio Gómez-Casares, Bissan Ghaddar +2
Over the last few years, there has been a surge in the use of learning techniques to improve the performance of optimization algorithms. In particular, the learning of branching ru…
Degree reduction techniques for polynomial optimization problems
Brais González-Rodríguez, Joe Naoum-Sawaya
This paper presents a new approach to quadrify a polynomial programming problem, i.e. reduce the polynomial program to a quadratic program, before solving it. The proposed approach…
Polynomial Optimization: Enhancing RLT relaxations with Conic Constraints
Brais González-Rodríguez, Raúl Alvite-Pazó, Samuel Alvite-Pazó +2
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tract…