A Sum of Squares Approximation of Nonnegative Polynomials
From MaRDI portal
Abstract: We show that every real nonnegative polynomial can be approximated as closely as desired by a sequence of polynomials that are sums of squares. Each has a simple et explicit form in terms of and . A special representation is also obtained for convex polynomials, nonnegative on a convex semi-algebraic set.
Recommendations
- Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set
- Approximating Positive Polynomials Using Sums of Squares
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Nonnegative polynomials and sums of squares
- Convexifying positive polynomials and sums of squares approximation
Cited in
(49)- Constraints on flavored 2d CFT partition functions
- Multihomogeneous nonnegative polynomials and sums of squares
- Analysis of optimization algorithms via sum-of-squares
- Data-driven optimal control with a relaxed linear program
- A note on imputing squares via polynomial combination approach
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Bounds-constrained polynomial approximation using the Bernstein basis
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
- Polynomials nonnegative on a grid and discrete optimization
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- Nonlinear analysis of vehicle control actuations based on controlled invariant sets
- Random graphons and a weak positivstellensatz for graphs
- Nonnegative Morse polynomial functions and polynomial optimization
- Nonnegative polynomials and sums of squares
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials
- An explicit representation as quasi-sum of squares of a polynomial generated by the AG inequality
- Convexifying positive polynomials and sums of squares approximation
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- Moment approximations for set-semidefinite polynomials
- Approximating Positive Polynomials Using Sums of Squares
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- Minimizing polynomials on noncompact sets
- Approximating nonnegative polynomials via spectral sparsification
- Polynomial optimization problems and their relaxations
- Computation of sum of squares polynomials from data points
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set
- Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
- A unified framework of SAGE and SONC polynomials and its duality theory
- Positive graphs
- Sum of squares generalizations for conic sets
- Sums of Separable and Quadratic Polynomials
- Optimal estimation of smooth transport maps with kernel SoS
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\)
- Semi-definite programming and quantum information
- High-order bounds-satisfying approximation of partial differential equations via finite element variational inequalities
- Finding global minima via kernel approximations
- The link between 1-norm approximation and effective Positivstellensätze for the hypercube
- Proximal Galerkin: a structure-preserving finite element method for pointwise bound constraints
- Two convergent NPA-like hierarchies for the quantum bilocal scenario
- A method for bounding high-order finite element functions: applications to mesh validity and bounds-preserving limiters
- Stable sparse operator inference for nonlinear structural dynamics
- Bounding escape rates and approximating quasi-stationary distributions of Brownian dynamics
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- A largish sum-of-squares implies circuit hardness and derandomization
- Moments and sums of squares for polynomial optimization and related problems
This page was built for publication: A Sum of Squares Approximation of Nonnegative Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432390)
