## Positive polynomials and convergence of LP and SDP relaxations |
Back |

Abstract: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 |

Speaker:Dr. Markus Schweighofer Fachbereich Mathematik und Statistik, Universität Konstanz | |

Date/Time:May 31, 2005 17:00 | |

Location: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 |