The goal is to address importat optimization problems as regards their mathematical formaulation and their efficient solution. In partiuclar concepts which are covered include constraint versus unconstraint optimization, convex optimization, duality, nonlinear optimization, discrete optimization and relaxation. A few important methods are covered including conjugate gradient, quasi Newton methods, interior point methods, Lagrange multipliers and barrier functions, and exemplary global optimization methods such as evolutionary strategies or local search.
Programmierkenntnisse (Python oder vergleichbar), Grundlagen Mathematik,
Rhythmus | Tag | Uhrzeit | Format / Ort | Zeitraum | |
---|---|---|---|---|---|
wöchentlich | Di | 10-12 | H11 | 07.10.2024-31.01.2025 |
Die verbindlichen Modulbeschreibungen enthalten weitere Informationen, auch zu den "Leistungen" und ihren Anforderungen. Sind mehrere "Leistungsformen" möglich, entscheiden die jeweiligen Lehrenden darüber.
The lecture will be accompanied by combined practical / theoretical exercises and a final exam.