Algorithms for computing the global infimum and minimum of a polynomial function
DOI10.1007/S11425-011-4326-2zbMATH Open1260.68486OpenAlexW2257286100MaRDI QIDQ424330FDOQ424330
Authors: Shuijing Xiao, Guangxing Zeng 
Publication date: 31 May 2012
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-011-4326-2
Recommendations
- Algorithms for computing the global infimum and minimum of a polynomial function
- Global minimization of multivariate polynomials using nonstandard methods
- Deciding reachability of the infimum of a multivariate polynomial
- Global minimization of a multivariate polynomial using matrix methods
- Semi-algebraically connected components of minimum points of a polynomial function
polynomial optimizationglobal minimumtransfer principleinterval representationglobal infimumrational univariate representationstrictly critical pointWu's method
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
- Lectures on formally real fields
- Title not available (Why is that?)
- On the extension of real places
- Global optimization of polynomials using generalized critical values and sums of squares
- An effective decision method for semidefinite polynomials
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Cited In (13)
- Globally minimizing polynomials without evaluating derivatives
- Global optimization of polynomials over real algebraic sets
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- Minimizing polynomial functions
- Determination of the limits for multivariate rational functions
- Simple global minimization algorithm for one-variable rational functions
- Equality-constrained minimization of polynomial functions
- Global minimization of multivariate polynomials using nonstandard methods
- Deciding reachability of the infimum of a multivariate polynomial
- Semi-algebraically connected components of minimum points of a polynomial function
- Solving the equality-constrained minimization problem of polynomial functions
- Algorithms for computing the global infimum and minimum of a polynomial function
- Computing the global optimum of a multivariate polynomial over the reals
Uses Software
This page was built for publication: Algorithms for computing the global infimum and minimum of a polynomial function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424330)
