A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
Abstract
We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set E in Rn. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset Emin of E where the minimum of g is attained, provided that Emin is non-empty and has at least one compact connected component.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.