Pages that link to "Item:Q5957271"

The following pages link to An algorithmic approach to Schmüdgen's Positivstellensatz (Q5957271):

Displaying 18 items.

• Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\) (Q368724) (← links)
• An algebraic certificate for Budan's theorem (Q531342) (← links)
• On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
• On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
• SOS approximations of nonnegative polynomials via simple high degree perturbations (Q883108) (← links)
• Effective Pólya semi-positivity for non-negative polynomials on the simplex (Q945921) (← links)
• A quantitative Pólya's theorem with zeros (Q1030259) (← links)
• Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra (Q1752981) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• A version of Putinar's Positivstellensatz for cylinders (Q2220198) (← links)
• Pólya's theorem with zeros (Q2275902) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets (Q2388440) (← links)
• Algorithms for quadratic forms (Q2474250) (← links)
• Polynomials that are positive on an interval (Q4501121) (← links)
• Théories géométriques pour l’algèbre des nombres réels (Q4635369) (← links)
• On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity (Q5108237) (← links)
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. (Q5951566) (← links)