|Mittagsseminar Talk Information|
Date and Time: Thursday, November 25, 2010, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Bernd Gärtner
Approximately Solving Semidefinite Programs
You may know that semidefinite programs can be solved in polynomial time. I will start by pointing out that this is not true. The best you can get in the Turing machine model is a solution with small absolute error, under favorable assumptions on the input (that are valid in many applications). This is done by the ellipsoid method.
Then I will sketch Hazan's simple and practically efficient algorithm in the real RAM model that solves semidefinite programs with a trace-1 constraint up to small relative error in polynomial time.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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.3392 | admin login