{\textsc{RealCertify}}: a Maple package for certifying non-negativity

DOI10.1145/3282678.3282681MaRDI QIDQ4630308zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: Let $mathbbQ$ (resp. $mathbbR$) be the field of rational (resp. real) numbers and $X=(X_1,ldots,X_n)$ be variables. Deciding the non-negativity of polynomials in $mathbbQ[X]$ over $mathbb{R}^n$ or over semi-algebraic domains defined by polynomial constraints in $mathbbQ[X]$ is a classical algorithmic problem for symbolic computation. The Maple package extsc{RealCertify} tackles this decision problem by computing sum of squares certificates of non-negativity for inputs where such certificates hold over the rational numbers. It can be applied to numerous problems coming from engineering sciences, program verification and cyber-physical systems. It is based on hybrid symbolic-numeric algorithms based on semi-definite programming.

Recommendations

• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
• NLCertify: a tool for formal nonlinear optimization
• Positive polynomials and sums of squares: theory and practice
• Certifying Polynomial Nonnegativity via Hyperbolic Optimization

Cited in

(12)

• 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
• NLCertify: a tool for formal nonlinear optimization
• RealCertify
• 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
• Computer-assisted proofs for Lyapunov stability via sums of squares certificates and constructive analysis
• Dual certificates of primal cone membership

Describes a project that uses

Uses Software

• Maple
• multivsos
• univsos

This page was built for publication: {\textsc{RealCertify}}: a Maple package for certifying non-negativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630308)