A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set (Formula presented.). We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset (Formula presented.) where the minimum of g is attained, provided th...
Guardado en:
Autores principales: | Jeronimo, G., Perrucci, D. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01795376_v52_n2_p260_Jeronimo |
Aporte de: |
Ejemplares similares
-
A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
por: Jeronimo, G., et al. -
A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
por: Perrucci, Daniel
Publicado: (2014) -
A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
Publicado: (2014) -
On the minimum of a polynomial function on a basic closed semialgebraic set and applications
por: Jeronimo, Gabriela Tali, et al.
Publicado: (2013) -
On the minimum of a polynomial function on a basic closed semialgebraic set and applications
por: Jeronimo, G., et al.