Algorithms for computing the global in mum and minimum of a polynomial function

DOI10.1360/012010-977zbMath1488.90194OpenAlexW3141112535MaRDI QIDQ5017688

Guangxing Zeng, Shuijing Xiao

Publication date: 17 December 2021

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/012010-977

zbMATH Keywords

global minimumpolynomial optimizationglobal infimumstrictly critical point

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30)

Related Items (3)

The invertibility of rational univariate representations ⋮ Proving inequalities and solving global optimization problems via simplified CAD projection ⋮ Semi-algebraically connected components of minimum points of a polynomial function

This page was built for publication: Algorithms for computing the global in mum and minimum of a polynomial function