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: | , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01795376_v52_n2_p260_Jeronimo |
Aporte de: |
id |
todo:paper_01795376_v52_n2_p260_Jeronimo |
---|---|
record_format |
dspace |
spelling |
todo:paper_01795376_v52_n2_p260_Jeronimo2023-10-03T15:08:33Z A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set Jeronimo, G. Perrucci, D. 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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 Jeronimo, G. Perrucci, D. 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. |
format |
JOUR |
author |
Jeronimo, G. Perrucci, D. |
author_facet |
Jeronimo, G. Perrucci, D. |
author_sort |
Jeronimo, G. |
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 |
url |
http://hdl.handle.net/20.500.12110/paper_01795376_v52_n2_p260_Jeronimo |
work_keys_str_mv |
AT jeronimog aprobabilisticsymbolicalgorithmtofindtheminimumofapolynomialfunctiononabasicclosedsemialgebraicset AT perruccid aprobabilisticsymbolicalgorithmtofindtheminimumofapolynomialfunctiononabasicclosedsemialgebraicset AT jeronimog probabilisticsymbolicalgorithmtofindtheminimumofapolynomialfunctiononabasicclosedsemialgebraicset AT perruccid probabilisticsymbolicalgorithmtofindtheminimumofapolynomialfunctiononabasicclosedsemialgebraicset |
_version_ |
1807324412945367040 |