Canadian Mathematical Society
  location:  PublicationsjournalsCMB
Abstract view

Optimization of Polynomial Functions

Open Access article
 Printed: Dec 2003
  • M. Marshall
Format:   HTML   LaTeX   MathJax   PDF   PostScript  


This paper develops a refinement of Lasserre's algorithm for optimizing a polynomial on a basic closed semialgebraic set via semidefinite programming and addresses an open question concerning the duality gap. It is shown that, under certain natural stability assumptions, the problem of optimization on a basic closed set reduces to the compact case.
MSC Classifications: 14P10, 46L05, 90C22 show english descriptions Semialgebraic sets and related spaces
General theory of $C^*$-algebras
Semidefinite programming
14P10 - Semialgebraic sets and related spaces
46L05 - General theory of $C^*$-algebras
90C22 - Semidefinite programming

© Canadian Mathematical Society, 2018 :