An algorithm for sums of squares of real polynomials
From MaRDI portal
Recommendations
- An algorithm for sums of squares of a class of positive semi-definite polynomials
- Positive polynomials and sums of squares: theory and practice
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
- Sufficient conditions for a real polynomial to be a sum of squares
- scientific article; zbMATH DE number 1490029
Cites work
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 66690 (Why is no real title available?)
- scientific article; zbMATH DE number 3593686 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination
- Solving systems of polynomial inequalities in subexponential time
Cited in
(59)- On real one-sided ideals in a free algebra
- Tight wavelet frames via semi-definite programming
- Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization
- Hilbert's 17th problem and best dual bounds in quadratic minimization
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Positive matrix representations of rational positive real functions of several variables
- Sparsity in sums of squares of polynomials
- Computing sum of squares decompositions with rational coefficients
- An algorithm for sums of squares of a class of positive semi-definite polynomials
- Semidefinite representations for finite varieties
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Sums of squares over totally real fields are rational sums of squares
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- Positive semidefinite diagonal minus tail forms are sums of squares
- Solving rank-constrained semidefinite programs in exact arithmetic
- A connected component labeling algorithm for implicitly defined domains
- Computation of sum of squares polynomials from data points
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach
- A linear algebra method to decompose forms whose length is lower than the number of variables into weighted sum of squares
- An algorithm for the global optimization of a class of continuous minimax problems
- Localization of periodic orbits of polynomial vector fields of even degree by linear functions
- Algorithms for quadratic forms
- Reflection groups and cones of sums of squares
- Symmetry groups, semidefinite programs, and sums of squares
- Synchronization of the bidirectionally coupled unified chaotic system via sum of squares method
- Higher-order discrete maximum principle for 1D diffusion-reaction problems
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
- The Pythagoras number of real sum of squares polynomials and sum of square magnitudes of polynomials
- Computing the length of sum of squares and Pythagoras element in a global field
- Smaller SDP for SOS decomposition
- Algorithms for multidimensional spectral factorization and sum of squares
- A novel approach to stability analysis for switched positive linear systems
- Design of Lyapunov functions for a class of homogeneous systems: generalized forms approach
- Non-existence of degree bounds for weighted sums of squares representations
- Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints
- Numerical approaches for collaborative data processing
- Positive Gorenstein ideals
- Robust static output feedback design for polynomial nonlinear systems
- Positive polynomials and sums of squares: theory and practice
- Noncoercive sums of squares in \(\mathbb R[x_1,\ldots ,x_n]\)
- Guaranteed error bounds for structured complexity reduction of biochemical networks
- Tunable halfband-pair wavelet filter banks and application to multifocus image fusion
- Noncommutative plurisubharmonic polynomials. I: Global assumptions
- Exact algorithms for linear matrix inequalities
- Sublinear circuits and the constrained signomial nonnegativity problem
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- Pythagoras numbers of real irreducible algebroid curves and Gram matrices
- Equivalence of sum of squares convex relaxations for quadratic distance problems
- Further results on sum-of-squares tensors
- Semidefinite programming relaxations and algebraic optimization in control
- Sums of squares and moment problems in equivariant situations
- A facial reduction algorithm for finding sparse SOS representations
- Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials
- Variation on Euclid's algorithm for polynomials
- On sums of squares of \(K\)-nomials
- Sufficient conditions for a real polynomial to be a sum of squares
- The length of \(x_1^4+x_2^4+x_3^4+x_4^4\) as a sum of squares
This page was built for publication: An algorithm for sums of squares of real polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295495)
