2 citations · 2 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2016
An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming
Mareike Dressler, Sadik Iliman, Timo de Wolff
In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, wh…
math.OC2014
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
Sadik Iliman, Timo de Wolff
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnega…