1 citations · 2 across the 4 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2026
Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
Giovanni Fantuzzi, Federico Fuentes
We identify a new sufficient condition for the finite convergence of moment relaxations of polynomial optimization problems with correlative sparsity. This condition, which follows…
math.OC2025
Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization
Marouan Handa, Marek Tyburec, Giovanni Fantuzzi +2
The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal…