Positivity and sums of squares: A guide to recent results
By Claus Scheiderer. 2009
133 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/ca43c912a12e5e2510e4539813ec675f3eb565fe
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Numerical Analysis
Citations in the corpus
- Optimality conditions and finite convergence of Lasserre’s hierarchy (2012, background): “Such problems always exist when the feasible set has dimension three or higher, as shown by Scheiderer [28].”
- Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization (2015, unknown): “ber of polynomial inequality constraints were investigated by Krivine [42], Stengle [82], Schmu¨dgen [76], and Putinar [68]. A theorem concerning such polynomials is referred to as Positivstellensatz [75]. For instance, Putinar proved under an assumption slightly stronger than compactness that they ”
- Robust stability and stabilization of uncertain linear positive systems via integral linear constraints: L1‐gain and L∞‐gain characterization (2013, background): “In [44, 45], it is shown that Handelman’s theorem implies Pólya’s theorem [46].”