Modules

4 results

A1.1 Optimization4

Nichtlineare OptimierungNo ratings for this module yet.You engage with theory and numerical methods of nonlinear optimization. You will learn advanced methods for unconstrained and, in particular, constrained optimization problems (e.g., SQP, barrier and interior-point methods) and you will be able to assess and apply convergence properties of such methods in the end.5 ECTSruns this semesterMA3503Algorithmic Game TheoryNo ratings for this module yet.You will learn the fundamentals of algorithmic game theory at the intersection of computer science, mathematics, and economics. In this module you will deal with algorithmic aspects of game-theoretic solution concepts such as Nash equilibria and with the design of economic mechanisms; in the end you will be able to analyze these concepts algorithmically and in terms of complexity theory.5 ECTSno date this semesterIN2239Modern Methods in Nonlinear OptimizationNo ratings for this module yet.You will learn selected modern methods of nonlinear optimization, e.g. convex and non-smooth optimization, interior-point methods, semidefinite programming, robustness concepts and duality. In the end you will be able to understand current research articles on the treated topics and you will be prepared to pursue your own research questions in nonlinear optimization.5 ECTSno date this semesterMA4503Polyhedral CombinatoricsNo ratings for this module yet.You learn how to approach combinatorial optimization problems through the geometry of polyhedra: representation of polytopes, the connection between geometry and optimization of linear functions, as well as modern algorithms such as branch-and-cut and separation/optimization. In the end you will be able to apply the methods to typical problems (e.g., matching, TSP polytopes) and assess their limits in the context of NP-hardness.6 ECTSno date this semesterMA5225