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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2014
Materias:
Complexity
Deformation techniques
Polynomial optimization
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:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_01795376_v52_n2_p260_Jeronimo
record_format dspace
spelling paper:paper_01795376_v52_n2_p260_Jeronimo2023-06-08T15:19:30Z A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set Complexity Deformation techniques Polynomial optimization 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. 2014 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
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Complexity
Deformation techniques
Polynomial optimization
spellingShingle Complexity
Deformation techniques
Polynomial optimization
A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
topic_facet Complexity
Deformation techniques
Polynomial optimization
description 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.
title A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
title_short A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
title_full A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
title_fullStr A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
title_full_unstemmed A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
title_sort probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
publishDate 2014
url 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
_version_ 1768541934917255168

Ejemplares similares