Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions
DOI10.1137/090772459zbMATH Open1279.90127OpenAlexW2064131066MaRDI QIDQ3083312FDOQ3083312
Lihong Zhi, Mohab Safey El Din
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00419983/file/RR-7045.pdf
Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Quantifier elimination, model completeness, and related topics (03C10)
Cited In (10)
- Sums of squares of polynomials with rational coefficients
- Exact algorithms for semidefinite programs with degenerate feasible set
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- A heuristic method for certifying isolated zeros of polynomial systems
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Title not available (Why is that?)
- Exact algorithms for linear matrix inequalities
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
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)
