Convex Optimization

SS 2021

Lecturer: Meriem Gharbi
Credits: 3V/1Ü

First Lecture: Friday, April 23th, 2021

Recent Information:

  1. The course takes place online via ILIAS /  WebEx. Please register for the ILIAS course "Convex Optimization" via C@MPUS.
  2. More information on the organization of the first lecture and the course will be available on ILIAS.

General information

Lecturers
Prerequisites

No specific prerequisites required

Lectures

Monday at 15:45, WebEx
Friday at 11:30, WebEx

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

Contact

To the top of the page