Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Positive polynomials and convergence of LP and SDP relaxations

Suppose you want to minimize a real polynomial function on a set defined by polynomial equalities and inequalities. How to find good linear or semidefinite programming relaxations to this problem? Results on representations of positive polynomials have a great impact on how this question has to be answered for a given concrete problem. We want to present a few vocabularies in the dictionary between real algebra and optimization.

Type of Seminar:
Public Seminar
Dr. Markus Schweighofer
Fachbereich Mathematik und Statistik, Universität Konstanz
May 31, 2005   17:00

ETH Zentrum, ETZL K 25
Contact Person:

Ioannis Fotiou
File Download:

Request a copy of this publication.
Biographical Sketch:
- comes from Bavarian Forest
- studied mathematics with a minor in computer science at Universität Passau
- Ph.D. in Real Algebra with Prof. Prestel in Konstanz, 2002
- Academic year 2002/2003 post doc in Rennes
- Since then member of the Real Geometry and Algebra group in Konstanz