Deciding reachability of the infimum of a multivariate polynomial

DOI10.1145/1993886.1993910zbMath1323.65074OpenAlexW1988709433MaRDI QIDQ5254163

Aurélien Greuet, Mohab Safey El Din

Publication date: 9 June 2015

Published in: Proceedings of the 36th international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993886.1993910

zbMATH Keywords

global optimizationpolynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)

Related Items (7)

VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Border basis relaxation for polynomial optimization ⋮ On the complexity of testing attainment of the optimal value in nonlinear optimization ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ Intrinsic complexity estimates in polynomial optimization ⋮ On stability and the Łojasiewicz exponent at infinity of coercive polynomials ⋮ Coercive Polynomials and Their Newton Polytopes

This page was built for publication: Deciding reachability of the infimum of a multivariate polynomial