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: Thursday, December 16, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Sebastian Stich

Principles of self-adaptation in randomized optimization.

Consider a global optimization problem in high dimension of which structure little is known (especially first and second order derivatives are not available or useful). In this situation so called direct search methods must be used. One of the search heuristics often used in practice is CMA-ES (covariance matrix adaption-evolution strategy), although there is yet no rigorous proof that this heuristic will converge to the optima even in case of a quadratic optimization problem. We give a short introduction to the designing principles of evolution strategies and mention some known theoretical results and open questions.

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