18 citations · 67 across the 13 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2013★ 7 cited
Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming
Mehdi Ghasemi, Murray Marshall
be elements of the polynomial ring . The paper deals with the general problem of computing a lower bound for on the subset of $\mathbb{…
math.OC2011★ 18 cited
Lower bounds for polynomials using geometric programming
Mehdi Ghasemi, Murray Marshall
We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R…