On the minimum of a positive polynomial over the standard simplex

dc.creatorJeronimo, Gabriela Tali
dc.creatorPerrucci, Daniel Roberto
dc.date.accessioned2020-03-02T19:32:26Z
dc.date.accessioned2022-10-15T16:59:32Z
dc.date.available2020-03-02T19:32:26Z
dc.date.available2022-10-15T16:59:32Z
dc.date.created2020-03-02T19:32:26Z
dc.date.issued2010-04
dc.identifierJeronimo, Gabriela Tali; Perrucci, Daniel Roberto; On the minimum of a positive polynomial over the standard simplex; Academic Press Ltd - Elsevier Science Ltd; Journal Of Symbolic Computation; 45; 4; 4-2010; 434-442
dc.identifier0747-7171
dc.identifierhttp://hdl.handle.net/11336/98653
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4412448
dc.description.abstractWe 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 coefficients of P and improves all the previous bounds for arbitrary polynomials which are positive over the simplex.
dc.languageeng
dc.publisherAcademic Press Ltd - Elsevier Science Ltd
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S074771711000009X
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.jsc.2010.01.001
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/0906.4377
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectOPTIMIZATION ON POLYHEDRA
dc.subjectPOSITIVITY OF POLYNOMIALS
dc.titleOn the minimum of a positive polynomial over the standard simplex
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución