Computing the global optimum of a multivariate polynomial over the reals
From MaRDI portal
Publication:5301605
DOI10.1145/1390768.1390781zbMath1487.65072OpenAlexW2065276731MaRDI QIDQ5301605
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1390768.1390781
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Numerical optimization and variational techniques (65K10)
Related Items (11)
Toward effective detection of the bifurcation locus of real polynomial maps ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Border basis relaxation for polynomial optimization ⋮ 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 ⋮ Proving inequalities and solving global optimization problems via simplified CAD projection ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ On types of degenerate critical points of real polynomial functions ⋮ Detecting bifurcation values at infinity of real polynomials ⋮ On stability and the Łojasiewicz exponent at infinity of coercive polynomials ⋮ Coercive Polynomials and Their Newton Polytopes
Uses Software
This page was built for publication: Computing the global optimum of a multivariate polynomial over the reals
