|
Course CAO: Convex Analysis for Optimization
Important informationParticipants of this course: please see the lecturers' website.Course descriptionConvexity plays an important role in optimization, particularly in nonlinear optimization. Many applications of optimization problems are nonlinear but have the convexity property. For convex optimization an elegant mathematical theory can be developed, including a duality theory and algorithmic aspects.Key words for the course are: convex sets and functions; separation theorems; subdifferential calculus; polarity; Karush-Kuhn-Tucker theorem; duality; minimax results in game theory; optimal consumption and investment in economics. Literature:Lecture notes will be provided. Further literature (also as indication for the level of the course):
PrerequisitesBasic knowledge (bachelor level) of analysis and linear algebra.ExaminationTake home problems.Address of the lecturers
Dr. Olga Kuryatnikova
Prof. Dr. J.C. Vera Lizcano |