Minimizing Polynomials Over Semialgebraic Sets

Authors Jiawang Nie, James Demmel, Victoria Powers

Publication date 17 February 2005

Abstract: This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in

e^{m}

defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper cite{njw_grad}, which considers minimizing polynomials on algebraic sets, i.e., sets in

e^{m}

defined by finitely many polynomial equations. Most of the theorems and conclusions in cite{njw_grad} generalize to semialgebraic sets, even in the case where the semialgebraic set is not compact. We discuss the method in some special cases, namely, when the semialgebraic set is contained in the nonnegative orthant

e_{+}^{n}

or in box constraints

[a, b]_{n}

. These constraints make the computations more efficient.

This page was built for publication: Minimizing Polynomials Over Semialgebraic Sets

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