R <scp>eal</scp> c <scp>ertify</scp>
From MaRDI portal
Publication:4630308
DOI10.1145/3282678.3282681zbMath1433.68625arXiv1805.02201MaRDI 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
68W30: Symbolic computation and algebraic computation
Related Items
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, In SDP Relaxations, Inaccurate Solvers Do Robust Optimization, Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares, RealCertify, An SOS counterexample to an inequality of symmetric functions, On exact Reznick, Hilbert-Artin and Putinar's representations, Converging outer approximations to global attractors using semidefinite programming, SONC optimization and exact nonnegativity certificates via second-order cone programming
Uses Software