All classes and the exam last three hours fifteen minutes (and include a 15min break).
| Date | Lecturer | Topic | |||
|---|---|---|---|---|---|
| Fri, 7.10.2016 | Dimo Brockhoff | Overview of Optimization Course, Introduction to Discrete Optimization and Graphs | slides | ||
| Fri, 28.10.2016 | Dimo Brockhoff | Greedy algorithms | slides | Exercise 1 | ipython notebook |
| Fri, 4.11.2016 | Dimo Brockhoff | Branch and bound [+ remaining greedy algorithm lecture/exercise] | slides | ||
| Fri, 18.11.2016 | Dimo Brockhoff | Dynamic programming | slides | Exercise 2 | ipython notebook |
| Mon, 21.11.2016 | Dimo Brockhoff | Approximation algorithms and heuristics [+ 2nd part of dynamic programming exercise] | slides | Optional Exercise | |
| Fri, 25.11.2016 | Dimo Brockhoff | Randomized Search Heuristics and Introduction to Continuous Optimization I | slides | ||
| Mon, 28.11.2016 | Dimo Brockhoff | Introduction to Continuous Optimization II | slides | Exercise 3 | ipython notebook |
| Mon, 5.12.2016 | Dimo Brockhoff | Introduction to Continuous Optimization III | slides | ||
| Fri, 9.12.2016 | Dimo Brockhoff | Constrained Optimization and Descent Methods | slides | Exercise 4 | ipython notebook |
| Mon, 12.12.2016 | Dimo Brockhoff | Derivative Free Optimization I: CMA-ES | slides | ||
| Fri, 16.12.2016 | Dimo Brockhoff | Derivative Free Optimization II: Benchmarking Continuous Optimizers | slides |