A bound on the minimum of a real positive polynomial over the standard simplex
| dc.creator | Basu, Saugata | |
| dc.creator | Leroy, Richard | |
| dc.creator | Roy, Marie-Francoise | |
| dc.date | 2009-02-19 | |
| dc.date.accessioned | 2026-07-07T12:44:08Z | |
| dc.date.available | 2026-07-07T12:44:08Z | |
| dc.description | We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a positive lower bound on m in terms of the dimension k, the degree d and the bitsize of the coefficients of P. The bound is explicit, and obtained without any extra assumption on P, in contrast with previous results reported in the literature. | |
| dc.identifier | https://arxiv.org/abs/0902.3304 | |
| dc.identifier | http://arxiv.org/abs/0902.3304 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/220663 | |
| dc.subject | Symbolic Computation | |
| dc.title | A bound on the minimum of a real positive polynomial over the standard simplex | |
| dc.type | text |