Semi-algebraically connected components of minimum points of a polynomial function
- 54 Downloads
In a recent article, the authors provided an effective algorithm for both computing the global infimum of f and deciding whether or not the infimum of f is attained, where f is a multivariate polynomial over the field R of real numbers. As a complement, the authors investigate the semi-algebraically connected components of minimum points of a polynomial function in this paper. For a given multivariate polynomial f over R, it is shown that the above-mentioned algorithm can find at least one point in each semi-algebraically connected component of minimum points of f whenever f has its global minimum.
Key wordsGlobal minimum minimum point polynomial optimization rational univariate representation (RUR) semi-algebraically connected component strictly critical point
Unable to display preview. Download preview PDF.
- Parrilo P A and Sturmfels B, Minimizing polynomial functions, Algorithmic and Quantitative Real Algebraic Geometry, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 60, Amer. Math. Soc., Providence, 2003, 83–100.Google Scholar
- Guo F, EI Din M S, and Zhi L H, Global optimization of polynomials using generalized critical values and sums of squares, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ACM, Munich, Germany, 2010.Google Scholar
- Wu W T, Mathematics Mechanization: Mechanical Geometry Theorem-Proving, Mechanical Geometry Problem-Solving and Polynomial Equations-Solving, Science Press/Kluwer Academic Publishers, Beijing/Dordrecht-Boston-London, 2000.Google Scholar
- Mishra B, Algorithmic Algebra, Texts and Monographs in Computer Science, Springer-Verlag, New York-Berlin-Heidelberg, 1993.Google Scholar