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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, June 17, 2014, 12:15 pm

Duration: 30 minutes

Location: CAB G11

Speaker: Martin Jaggi

A Short Tutorial on Frank-Wolfe Algorithms for Sparse Convex Optimization

For constrained (and bounded) convex optimization problems, there are two main conceptual types of first-order methods: (Projected) gradient based methods on one hand, and Frank-Wolfe methods on the other hand. In this talk I'll try to give an overview over the latter ones. We'll also discuss several applications, and relations to greedy optimization and sparse optimization with atomic decompositions.

Tutorial website for more information:

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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