We consider the problem of computing the minimum of a polynomial function (Formula presented.) 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.) of (Formula presented.) where the minimum of (Formula presented.) is attained, provided that (Formula presented.) is non-empty and has at least one compact connected component. © 2014 Springer Science+Business Media New York.
Documento: | Artículo |
Título: | A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set |
Autor: | Jeronimo, G.; Perrucci, D. |
Filiación: | Departamento de Matemática, FCEN, Universidad de Buenos Aires, Buenos Aires, Argentina IMAS, CONICET-UBA, Buenos Aires, Argentina CONICET, Buenos Aires, Argentina |
Palabras clave: | Complexity; Deformation techniques; Polynomial optimization |
Año: | 2014 |
DOI: | http://dx.doi.org/10.1007/s00454-014-9619-0 |
Título revista: | Discrete & Computational Geometry |
Título revista abreviado: | Discrete Comput. Geom. |
ISSN: | 01795376 |
Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01795376_v_n_p_Jeronimo |