Computing rational points in convex semialgebraic sets and sum of squares decompositions
From MaRDI portal
Publication:3083312
Recommendations
- Computing sum of squares decompositions with rational coefficients
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Computing rational solutions of linear matrix inequalities
- Convexifying positive polynomials and sums of squares approximation
- On exact Polya and Putinar's representations
Cited in
(9)- A heuristic method for certifying isolated zeros of polynomial systems
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Exact algorithms for linear matrix inequalities
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- scientific article; zbMATH DE number 1262423 (Why is no real title available?)
- Sums of squares of polynomials with rational coefficients
This page was built for publication: Computing rational points in convex semialgebraic sets and sum of squares decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083312)
