Modules

5 results

Elective Modules5

Mathematical Modules5

A1.3 Optimization5

Discrete OptimizationNo ratings for this module yet.Mathematical Modules › A1.3 OptimizationYou will learn central concepts and algorithms of linear integer optimization and combinatorial optimization. In the module you will analyze mathematical structures that allow efficient solution methods, and you will be able to model real problems as discrete optimization problems and identify special cases that are efficiently solvable.9 ECTSruns this semesterCIT413041Modern Methods in Nonlinear OptimizationNo ratings for this module yet.Mathematical Modules › A1.3 OptimizationYou 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 semesterMA4503Modern Methods in Nonlinear OptimizationNo ratings for this module yet.Mathematical Modules › A1.3 OptimizationYou will learn selected modern methods of nonlinear optimization, such as convex methods, nonsmooth optimization, interior-point methods, semidefinite programming, robustness approaches, duality, or globalization techniques. In the end, you will be able to read current research articles on the treated topics and follow the presented methods independently further.5 ECTSno date this semesterMA4505Nonlinear OptimizationNo ratings for this module yet.Mathematical Modules › A1.3 OptimizationYou 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 semesterMA3503Polyhedral CombinatoricsNo ratings for this module yet.Mathematical Modules › A1.3 OptimizationYou 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