### Selin Damla Ahipasaoglu (London School of Economics)

#### Convex relaxations for subset selection

*Wednesday 7 March 2012 at 15.30, JCMB 6206*

##### Abstract

We use convex relaxation techniques to produce lower bounds on the optimal
value of subset selection problems and generate good approximate solutions.
We then explicitly bound the quality of these relaxations by studying the
approximation ratio of sparse eigenvalue relaxations. Our results are used
to improve the performance of branch-and-bound algorithms to produce exact
solutions to subset selection problems.

### Seminars by year

*Current*
*2016*
*2015*
*2014*
*2013*
*2012*
*2011*
*2010*
*2009*
*2008*
*2007*
*2006*
*2005*
*2004*
*2003*
*2002*
*2001*
*2000*
*1999*
*1998*
*1997*
*1996*