کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
403297 | 677084 | 2012 | 15 صفحه PDF | دانلود رایگان |
We present a hybrid symbolic-numeric algorithm for certifying a polynomial or rational function with rational coefficients to be non-negative for all real values of the variables by computing a representation for it as a fraction of two polynomial sum-of-squares (SOS) with rational coefficients. Our new approach turns the earlier methods by Peyrl and Parrilo at SNC’07 and ours at ISSAC’08 both based on polynomial SOS, which do not always exist, into a universal algorithm for all inputs via Artin’s theorem.Furthermore, we scrutinize the all-important process of converting the numerical SOS numerators and denominators produced by block semidefinite programming into an exact rational identity. We improve on our own Newton iteration-based high precision refinement algorithm by compressing the initial Gram matrices and by deploying rational vector recovery aside from orthogonal projection. We successfully demonstrate our algorithm on (1) various exceptional SOS problems with necessary polynomial denominators from the literature and on (2) very large (thousands of variables) SOS lower bound certificates for Rump’s model problem (up to n=18n=18, factor degree=17factor degree=17).
► Our paper gives exact proofs for global optima of polynomial and rational function.
► Our algorithm solves classical sum-of-squares problems and the Rump model problem up to degree 17.
► Our paper is dedicated to the memory of Wenda Wu (1929–2009).
Journal: Journal of Symbolic Computation - Volume 47, Issue 1, January 2012, Pages 1–15