The lecture will not take place in winter term 2018/19
General information
- Lecturer
- Assistant
- Prerequisites
-
No specific prerequisites required
- Lectures
-
Wednesday 09:45-11:15 V9.41
Thursday 14:00-16:00 V9.41
Content
The course provides an introduction to the theory and application of convex optimization including topics on convex sets and functions, optimality conditions, conic programming, duality theory, and numerical algorithms.
Information
The lecture material is available on the ILIAS-page of the course.
Literature
- S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge, 2004
- D. Bertsekas, Convex Analysis and Optimization, Athena Scientific, 2003
Exam
tba