13 citations · 13 across the 4 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
quant-ph2025
Certified bounds on optimization problems in quantum theory
Younes Naceur, Jie Wang, Victor Magron +1
Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitou…
math.OC2025
Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Igor Klep, Victor Magron, Tobias Metzlaff +1
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programmi…