Computing rational solutions of linear matrix inequalities

Authors:
Qingdong Guo;Mohab Safey EI Din;Lihong Zhi
Affiliations:
Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing, China;UPMC, Univ Paris 06/INRIA, Paris-Rocquencourt Center, POLSYS project-team/CNRS LIP6 UMR 7606/Institut Universitaire de France, Paris, France;Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing, China
Venue:
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Year:
2013

Citing 12
Cited 0

On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)
Computing integral points in convex semi-algebraic sets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Computing the global optimum of a multivariate polynomial over the reals

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Computing sum of squares decompositions with rational coefficients

Theoretical Computer Science
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination

Proceedings of the 2009 conference on Symbolic numeric computation
Deciding reachability of the infimum of a multivariate polynomial

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients

Journal of Symbolic Computation
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions

SIAM Journal on Optimization
Global optimization of polynomials restricted to a smooth variety using sums of squares

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a (D x D) symmetric matrix A whose entries are linear forms in Q[X1, ..., Xk] with coefficients of bit size ≤ τ. We provide an algorithm which decides the existence of rational solutions to the linear matrix inequality A ≥ 0 and outputs such a rational solution if it exists. This problem is of first importance: it can be used to compute algebraic certificates of positivity for multivariate polynomials. Our algorithm runs within (k≤)O(1)2O(min(k, D)D2)DO(D2) bit operations; the bit size of the output solution is dominated by τO(1)2O(\min(k, D)D2). These results are obtained by designing algorithmic variants of constructions introduced by Klep and Schweighofer. This leads to the best complexity bounds for deciding the existence of sums of squares with rational coefficients of a given polynomial. We have implemented the algorithm; it has been able to tackle Scheiderer's example of a multivariate polynomial that is a sum of squares over the reals but not over the rationals; providing the first computer validation of this counter-example to Sturmfels' conjecture.