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...
| Publicado: |
2014
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v52_n2_p260_Jeronimo http://hdl.handle.net/20.500.12110/paper_01795376_v52_n2_p260_Jeronimo |
| Aporte de: |
| Sumario: | 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 that (Formula presented.) is non-empty and has at least one compact connected component. © 2014, Springer Science+Business Media New York. |
|---|