On the complexity of Putinar's Positivstellensatz
Authors:
- Jiawang NieJNJiawang Nie
- Markus SchweighoferMSMarkus Schweighofer
Top Cited Papers
- 1 February 2007
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 23 (1) , 135-150
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Representations of non-negative polynomials having finitely many zerosAnnales de la Faculté des sciences de Toulouse : Mathématiques, 2006
- Minimizing Polynomials via Sum of Squares over the Gradient IdealMathematical Programming, 2005
- Distinguished representations of non-negative polynomialsJournal of Algebra, 2005
- Sparsity in sums of squares of polynomialsMathematical Programming, 2004
- On the complexity of Schmüdgen's PositivstellensatzJournal of Complexity, 2004
- Optimization of Polynomial FunctionsCanadian Mathematical Bulletin, 2003
- An algorithmic approach to Schmüdgen's PositivstellensatzJournal of Pure and Applied Algebra, 2002
- A new bound for Pólya's Theorem with applications to polynomials positive on polyhedraJournal of Pure and Applied Algebra, 2001
- Semidefinite optimizationActa Numerica, 2001
- Complexity Estimates for the Schmüdgen PositivstellensatzJournal of Complexity, 1996