Semi-algebraic description of the closure of the image of a semi-algebraic set under a polynomial

arXiv2210.13933MaRDI QIDQ6415045FDOQ6415045

Authors: Ngoc Hoang Anh Mai 

Publication date: 25 October 2022

Abstract: Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e., �egin{equation} Q=overline{f(S)},. end{equation} Consequently, every polynomial optimization problem whose optimum value is finite has an equivalent form with attained optimum value, i.e., �egin{equation} min limits_{tin Q} t =inflimits_{xin S} f(x) end{equation} whenever the right-hand side is finite. Given $d$ as the upper bound on the degrees of $f$ and polynomials defining $S$, we prove that our method requires $O(d^{O(n)})$ arithmetic operations to produce polynomials of degrees at most $d^{O(n)}$ defining $overlinef(S)$.

This page was built for publication: Semi-algebraic description of the closure of the image of a semi-algebraic set under a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415045)