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

DOI10.1007/S11424-013-2134-1MaRDI QIDQ741867zbMATH OpenOpenAlexFDO

Authors Shuijing Xiao, Guangxing Zeng

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

polynomial optimizationglobal minimumstrictly critical pointminimum 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)

Recommendations

• Algorithms for computing the global infimum and minimum of a polynomial function
• Algorithms for computing the global infimum and minimum of a polynomial function
• Global minimization of a multivariate polynomial using matrix methods
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
• Global optimization of polynomials over real algebraic sets

Cites work

• scientific article; zbMATH DE number 1601215 (Why is no real title available?)
• scientific article; zbMATH DE number 1201576 (Why is no real title available?)
• scientific article; zbMATH DE number 517393 (Why is no real title available?)
• scientific article; zbMATH DE number 1984325 (Why is no real title available?)
• Algorithms for computing the global infimum and minimum of a polynomial function
• Algorithms for computing the global infimum and minimum of a polynomial function
• Algorithms in real algebraic geometry
• An effective decision method for semidefinite polynomials
• Computing global minima to polynomial optimization problems using Gröbner bases
• Global minimization of a multivariate polynomial using matrix methods
• Global optimization of polynomials using generalized critical values and sums of squares
• Minimizing polynomials via sum of squares over the gradient ideal
• The search for the maximum of a polynomial

Cited in

(4)

• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
• On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
• Algorithms for computing the global infimum and minimum of a polynomial function
• Global minimization of a multivariate polynomial using matrix methods

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741867)