13 search results - page 1 / 3 » On the minimum of a positive polynomial over the standard si... |
JSC
2010
13 years 3 months ago
2010
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
EOR
2008
13 years 5 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
MP
2006
13 years 5 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
STOC
1996
ACM
13 years 9 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...