Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 15, 2001, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Pablo A. Parrilo (Institut für Automatik, ETH)

Polynomial Optimization and Semidefinite Programming

Many applied math problems can be completely characterized with a finite number of polynomial inequalities and inequalities. A few concrete examples are geometric theorems, graph theoretic problems, and issues of network survivability and reliability. In general, this class of problems have bad complexity properties, and exact algorithms to solve them are usually computationally infeasible.

As a consequence, considerable research efforts have been directed towards the efficient computation of approximate solutions (or bounds). In this talk, we present a new convex optimization framework for polynomial-based problems. The key element is the interaction of concepts from real algebra and convex optimization, in particular a semidefinite programming formulation for the sums of squares decomposition for multivariable polynomials.

The developed techniques unify and generalize many well-known existing results. The ideas and algorithms will be illustrated with examples from a broad range of application domains.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login