Global Optimization with Polynomials and the Problem of Moments

  • Authors:

  • Jean B. Lasserre

  • Affiliations:

  • -

  • Venue:
  • SIAM Journal on Optimization
  • Year:
  • 2000

Quantified Score

Hi-index 0.03

Visualization

Abstract

We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb{R}}$, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems. A notion of Karush--Kuhn--Tucker polynomials is introduced in a global optimality condition. Some illustrative examples are provided.