Semi-algebraically connected components of minimum points of a polynomial function

DOI10.1007/s11424-013-2134-1zbMath1299.90331OpenAlexW2091380492MaRDI QIDQ741867

Guangxing Zeng, Shuijing Xiao

Publication date: 15 September 2014

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-013-2134-1

zbMATH Keywords

global minimumminimum pointpolynomial optimizationstrictly critical pointrational univariate representation (RUR)semi-algebraically connected component

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Separable extensions, Galois theory (12F10) Semialgebraic sets and related spaces (14P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for computing the global infimum and minimum of a polynomial function
• The search for the maximum of a polynomial
• Global minimization of a multivariate polynomial using matrix methods
• An effective decision method for semidefinite polynomials
• Computing global minima to polynomial optimization problems using Gröbner bases
• Minimizing polynomials via sum of squares over the gradient ideal
• Global optimization of polynomials using generalized critical values and sums of squares
• Algorithms for computing the global in mum and minimum of a polynomial function
• Algorithms in real algebraic geometry

This page was built for publication: Semi-algebraically connected components of minimum points of a polynomial function