- Characterizing polynomials with roots in a semi-algebraic set Jean B. Lasserre (lasserrelaas.fr) Abstract: Consider a real polynomial $p$ and a semi-algebraic subset $S$ of the complex plane, defined by finitely many polynomial inequalities $g_k(z,\bar{z}) \geq 0$ for some complex polynomials $\{g_k\}$. We provide necessary and sufficient conditions on the coefficients of $p$ for the zeros of $p$ to be in $S$. Keywords: algebraic geometry; root clustering Category 1: Applications -- Science and Engineering (Control Applications ) Category 2: Other Topics (Other ) Citation: IEEE Trans. Automatic Control 49 (2004), pp. 727--730. Download: Entry Submitted: 11/05/2003Entry Accepted: 11/05/2003Entry Last Modified: 10/05/2004Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Programming Society and by the Optimization Technology Center.