Mathematics – Algebraic Geometry
Scientific paper
2005-11-24
Mathematics
Algebraic Geometry
22 pages
Scientific paper
In this work, the combine the theory of generalized critical values with the theory of iterated rings of bounded elements (real holomorphy rings). We consider the problem of computing the global infimum of a real polynomial in several variables. Every global minimizer lies on the gradient variety. If the polynomial attains a minimum, it is therefore equivalent to look for the greatest lower bound on its gradient variety. Nie, Demmel and Sturmfels proved recently a theorem about the existence of sums of squares certificates for such lower bounds. Based on these certificates, they find arbitrarily tight relaxations of the original problem that can be formulated as semidefinite programs and thus be solved efficiently. We deal here with the more general case when the polynomial is bounded from belo w but does not necessarily attain a minimum. In this case, the method of Nie, Demmel and Sturmfels might yield completely wrong results. In order to overcome this problem, we replace the gradient variety by larger semialgebraic sets which we call gradient tentacles. It now gets substantially harder to prove the existence of the necessary sums of squares certificates.
No associations
LandOfFree
Global optimization of polynomials using gradient tentacles and sums of squares does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Global optimization of polynomials using gradient tentacles and sums of squares, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global optimization of polynomials using gradient tentacles and sums of squares will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-424692