Computational Convexity - Optimal Containment

What it is about

You deal with algorithmic questions on convex problems in arbitrary dimensions and, to some extent, in generalized normed spaces. In the module you will learn typical problems such as optimal containment, the underlying concepts of convex analysis and techniques from linear optimization, as well as their algorithmic solution and analysis.

What you will be able to do

• Understand typical problems of Computational Convexity
• Knowledge of the relevant foundations from convex analysis and linear programming
• Analysis and evaluation of algorithms for convex problems
• Development of new algorithms and models for related problem settings
• Understanding of transformations in hardness proofs and their application

What the module consists of

• LectureConveying the theoretical foundations and central concepts
• ExerciseApplication of the content, solving tasks; mixture of teacher- and student-centered depending on number of participants

Teaching method

• Lecture (teacher-centered)for the introduction and explanation of the theoretical concepts
• Exercise formats (teacher- and student-centered)for deepening, practical application and independent problem solving; adaptation to number and abilities of the students