Impact of domain reduction techniques in polynomial optimization: A computational study
I Gómez-Casares, B González-Rodríguez… - arXiv preprint arXiv …, 2024 - arxiv.org
Domain reduction techniques are at the core of any global optimization solver for NLP or
MINLP problems. In this paper, we delve into several of these techniques and assess the …
MINLP problems. In this paper, we delve into several of these techniques and assess the …
Learning in Spatial Branching: Limitations of Strong Branching Imitation
B González-Rodríguez, I Gómez-Casares… - arXiv preprint arXiv …, 2024 - arxiv.org
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 rules in …
the performance of optimization algorithms. In particular, the learning of branching rules in …
Optimality-Based Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
We use sensitivity analysis to design $\textit {optimality-based} $ discretization (cutting-
plane) methods for the global optimization of nonconvex semi-infinite programs (SIPs). We …
plane) methods for the global optimization of nonconvex semi-infinite programs (SIPs). We …