10 citations · 11 across the 5 of their papers we have counts for
4 papers · 1 filter
Duality attainment and strict feasibility of the generalized moment problem and its relaxations
Sami Halaseh, Victor Magron, Mateusz Skomra
The generalized moment problem (GMP) is an infinite dimensional linear problem over the cone of finite nonnegative Borel measures. When a GMP instance involves finitely many polyno…
Finite Convergence of the Moment-SOS Hierarchy on the Product of Spheres
Sami Halaseh, Victor Magron, Mateusz Skomra
We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimiz…
Reducing Stochastic Games to Semidefinite Program Feasibility
Manuel Bodirsky, Georg Loho, Mateusz Skomra
We present a polynomial-time reduction from max-plus-average constraints to the feasibility problem for semidefinite programs. This shows that Condon's simple stochastic games, sto…
Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming
Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz +1
Semidefinite programming can be considered over any real closed field, including fields of Puiseux series equipped with their nonarchimedean valuation. Nonarchimedean semidefinite…