On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015): Difference between revisions

The authors consider the problem of computing exact sums of squares (SOS) decompositions for some classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. They develop a hybrid numeric-symbolic algorithm, called \textit{intsos}, that computes exact rational SOS decompositions with rational coefficients for polynomials lying in the interior of the SOS cone. Also, they prove that bit complexity estimates on output size and runtime are both polynomial in the degree of the input polynomial and singly exponential in the number of variables. Relying on the \textit{intsos}, they introduce algorithms \textit{Reznicksos}, \textit{Hilbertsos}, and \textit{Putinarsos} to compute exact Reznick, Hilbert-Artin's representation, and Putinar's representations respectively for positive definite forms and positive polynomials over basic compact semi-algebraic sets. They also provide practical experiments done with the implementation of these algorithms and existing alternatives such as the critical point method and cylindrical algebraic decomposition.