A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set

GABRIELA JERONIMO; DANIEL PERRUCCI

Frankfurt

Conferencia; Effective Methods in Algebraic Geometry (MEGA 2013); 2013

We consider the problem of computing the minimum of a polynomial function g over a basic closed semialgebraic set E, assuming that the function g attains a minimum value over E. We present a probabilistic algorithm to find a finite set of sample points of the subset of E where the minimum is attined, provided that the set of minimizers satisfies a certain compactness assumption.