On the minimum of a positive polynomial over the standard simplex
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk, assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize τ of the coeffi...
Guardado en:
| Autores principales: | Jeronimo, Gabriela Tali, Perrucci, Daniel |
|---|---|
| Publicado: |
2010
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_07477171_v45_n4_p434_Jeronimo http://hdl.handle.net/20.500.12110/paper_07477171_v45_n4_p434_Jeronimo |
| Aporte de: |
Ejemplares similares
-
On the minimum of a positive polynomial over the standard simplex
por: Jeronimo, G., et al.
Publicado: (2010) -
On the minimum of a positive polynomial over the standard simplex
por: Jeronimo, G., et al.
Publicado: (2010) -
On the minimum of a positive polynomial over the standard simplex
por: Jeronimo, G., et al. -
On the minimum of a polynomial function on a basic closed semialgebraic set and applications
por: Jeronimo, Gabriela Tali, et al.
Publicado: (2013) -
A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
por: Jeronimo, G., et al.