Computing sum of squares decompositions with rational coefficients
From MaRDI portal
Recommendations
- On exact Polya and Putinar's representations
- Facial reduction for exact polynomial sum of squares decomposition
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Rational sums of hermitian squares of free noncommutative polynomials
Cites work
- A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
- A general formula for the algebraic degree in semidefinite programming
- An algorithm for sums of squares of real polynomials
- An inequality for circle packings proved by semidefinite programming
- Class of global minimum bounds of polynomial functions
- CSDP, A C library for semidefinite programming
- Extremal psd forms with few terms
- Factoring polynomials with rational coefficients
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 1601019 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3695547 (Why is no real title available?)
- scientific article; zbMATH DE number 3728055 (Why is no real title available?)
- scientific article; zbMATH DE number 53154 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- New upper bounds for kissing numbers from semidefinite programming
- Nonlinear Control Synthesis by Convex Optimization
- Semidefinite Programming
- Semidefinite programming relaxations for semialgebraic problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sums of Hermitian squares and the BMV conjecture
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sur la représentation en somme de carrés des polynômes à une indéterminée sur un corps de nombres algébriques
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Verifying Nonlinear Real Formulas Via Sums of Squares
Cited in
(60)- A heuristic method for certifying isolated zeros of polynomial systems
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
- Vector barrier certificates and comparison systems
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Dimension-free entanglement detection in multipartite Werner states
- Testing hyperbolicity of real polynomials
- Sums of squares in Macaulay2
- Polynomially parameter dependent exponential stabilization of sampled-data LPV systems
- Certification of real inequalities: templates and sums of squares
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Converging outer approximations to global attractors using semidefinite programming
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Computing rational points in convex semialgebraic sets and sum of squares decompositions
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Use of residues to compute the sum of the squares of the Taylor coefficients of a rational function of two variables
- Verifying Nonlinear Real Formulas Via Sums of Squares
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
- Exact certification in global polynomial optimization via rationalizing sums-of-squares
- Sum-of-squares optimization without semidefinite programming
- Real stability testing
- Exact Semidefinite Programming Bounds for Packing Problems
- Certified Hermite Matrices from Approximate Roots - Univariate Case
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Sharper and Simpler Nonlinear Interpolants for Program Verification
- Computation of sum of squares polynomials from data points
- On exact Polya and Putinar's representations
- Formal Proofs for Nonlinear Optimization
- Facial reduction for exact polynomial sum of squares decomposition
- A linear algebra method to decompose forms whose length is lower than the number of variables into weighted sum of squares
- A note on the nonexistence of sum of squares certificates for the Bessis-Moussa-Villani conjecture
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Validating numerical semidefinite programming solvers for polynomial invariants
- Convex computation of maximal Lyapunov exponents
- A practical approach to SOS relaxations for detecting quantum entanglement
- Stability analysis of a bacterial growth model through computer algebra
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
- Moment ratio inequality of bivariate Gaussian distribution and three-dimensional Gaussian product inequality
- On the degree of varieties of sum of squares
- Stability analysis of sampled-data control systems with input saturation: a hybrid system approach
- Noncommutative nullstellensätze and perfect games
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- A hybrid approach to the stability analysis of sampled-data Lur'e systems
- The Lorenz system as a gradient-like system
- Using sums-of-squares to prove Gaussian product inequalities
- The constant trace property in noncommutative optimization
- Cross-positive linear maps, positive polynomials and sums of squares
- Certifying solutions of degenerate semidefinite programs
- Computer-assisted proofs for Lyapunov stability via sums of squares certificates and constructive analysis
- A convex polynomial that is not sos-convex
- Equilibrium problems involving the Lorentz cone
- Smaller SDP for SOS decomposition
- Inflation of poorly conditioned zeros of systems of analytic functions
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
Describes a project that uses
Uses Software
This page was built for publication: Computing sum of squares decompositions with rational coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378506)
