On the complexity of Putinar's Positivstellensatz

Simple item page
dc.creatorNie, Jiawang
dc.creatorSchweighofer, Markus
dc.date2008-12-14
dc.date.accessioned2026-07-07T12:12:48Z
dc.date.available2026-07-07T12:12:48Z
dc.descriptionWe prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schmüdgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get information about the convergence rate of Lasserre's procedure for optimization of a polynomial subject to polynomial constraints.
dc.identifierhttps://arxiv.org/abs/0812.2657
dc.identifierhttp://arxiv.org/abs/0812.2657
dc.identifierJournal of Complexity 23, 1 (2006) 135-150
dc.identifierdoi:10.1007/10.1016/j.jco.2006.07.002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210664
dc.subjectAlgebraic Geometry
dc.subjectCommutative Algebra
dc.subjectOptimization and Control
dc.subject11E25, 13J30, 14P10, 44A60, 68W40, 90C22
dc.titleOn the complexity of Putinar's Positivstellensatz
dc.typetext

Files

Collections

arXiv