Algorithms for computing the global infimum and minimum of a polynomial function
From MaRDI portal
(Redirected from Publication:5017688)
Algorithms for computing the global infimum and minimum of a polynomial function (scientific article; zbMATH DE number 7449010)
Algorithms for computing the global infimum and minimum of a polynomial function (scientific article; zbMATH DE number 7449010)
Recommendations
- Algorithms for computing the global infimum and minimum of a polynomial function
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- 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
Cited in
(11)- Global minimization of a multivariate polynomial using matrix methods
- Solving the equality-constrained minimization problem of polynomial functions
- Algorithms for computing the global infimum and minimum of a polynomial function
- Global minimization of multivariate polynomials using nonstandard methods
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
- Proving inequalities and solving global optimization problems via simplified CAD projection
- Deciding reachability of the infimum of a multivariate polynomial
- Computing the global optimum of a multivariate polynomial over the reals
- The invertibility of rational univariate representations
- Minimizing polynomial functions
- Semi-algebraically connected components of minimum points of a polynomial function
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 Q5017688)
