arXiv · 1304.5558
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 R^n. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset E^{min} of E where the minimum of g is attained, provided that E^{min} is non-empty and has at least one compact connected component.
Explore related subjects
Keep this discovery
Gabriela Jeronimo, Daniel Perrucci. 2013-04-19. A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set. https://arxiv.org/abs/1304.5558
Cite the original work for its findings. Save a collection to share your selection of sources.