22 citations · 32 across the 6 of their papers we have counts for
6 papers
Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes
Gabriele Iommazzo, David Martínez-Rubio, Francisco Criado +2
We study the linear convergence of Frank-Wolfe algorithms over product polytopes. We analyze two condition numbers for the product polytope, namely the \emph{pyramidal width} and t…
The Algorithm Configuration Problem
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
The field of algorithmic optimization has significantly advanced with the development of methods for the automatic configuration of algorithmic parameters. This article delves into…
Learning to Configure Mathematical Programming Solvers by Mathematical Programming
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
We discuss the issue of finding a good mathematical programming solver configuration for a particular instance of a given problem, and we propose a two-phase approach to solve it.…
A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
We propose a methodology, based on machine learning and optimization, for selecting a solver configuration for a given instance. First, we employ a set of solved instances and conf…
Improved local models and new Bell inequalities via Frank-Wolfe algorithms
Sébastien Designolle, Gabriele Iommazzo, Mathieu Besançon +3
In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope: constructing local models and deriving se…
Cycle-based formulations in Distance Geometry
Leo Liberti, Gabriele Iommazzo, Carlile Lavor +1
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight s…