11 citations · 47 across the 48 of their papers we have counts for
Showing 2021 · math.OCShow all
2 papers · 2 filters
math.OC2021
A remark on the approximation of non-negative polynomials by SONC polynomials
Gennadiy Averkov
A SONC polynomial is a sum of finitely many non-negative circuit polynomials, whereas a non-negative circuit polynomial is a non-negative polynomial whose support is a simplicial c…
math.OC2021
Computational Aspects of Relaxation Complexity: Possibilities and Limitations
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
The relaxation complexity of the set of integer points contained in a polyhedron is the smallest number of facets of any polyhedron such that the integer p…