38 citations · 38 across the 3 of their papers we have counts for
1 paper · 2 filters
Lea Kapelevich, Chris Coey, Juan Pablo Vielma
In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite program…