Semi-algebraically connected components of minimum points of a polynomial function
DOI10.1007/S11424-013-2134-1zbMATH Open1299.90331OpenAlexW2091380492MaRDI QIDQ741867FDOQ741867
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
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
polynomial optimizationglobal minimumstrictly critical pointminimum pointrational univariate representation (RUR)semi-algebraically connected component
Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Separable extensions, Galois theory (12F10) Semialgebraic sets and related spaces (14P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing polynomials via sum of squares over the gradient ideal
- Algorithms in real algebraic geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization of polynomials using generalized critical values and sums of squares
- An effective decision method for semidefinite polynomials
- The search for the maximum of a polynomial
- Global minimization of a multivariate polynomial using matrix methods
- Computing global minima to polynomial optimization problems using Gröbner bases
- Algorithms for computing the global infimum and minimum of a polynomial function
- Algorithms for computing the global infimum and minimum of a polynomial function
Cited In (4)
- Algorithms for computing the global infimum and minimum of a polynomial function
- Global minimization of a multivariate polynomial using matrix methods
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
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)