R <scp>eal</scp> c <scp>ertify</scp>

DOI10.1145/3282678.3282681zbMath1433.68625arXiv1805.02201OpenAlexW2963661913MaRDI QIDQ4630308

Victor Magron, Mohab Safey El Din

Publication date: 29 March 2019

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.02201

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (9)

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Converging outer approximations to global attractors using semidefinite programming ⋮ SONC optimization and exact nonnegativity certificates via second-order cone programming ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ An SOS counterexample to an inequality of symmetric functions ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ RealCertify ⋮ In SDP Relaxations, Inaccurate Solvers Do Robust Optimization

Uses Software

• Maple
• multivsos
• univsos

This page was built for publication: R <scp>eal</scp> c <scp>ertify</scp>