Disclaimer: This is work in progress!
This repo contains the material used for the lecture with the name as in the title, being taught at the University of Vienna in the winter semester of 21.
-
Details regarding assessment can be found on ufind.
-
The corresponding moodle course can be found here. Note that this can only be accessed if you are registered for the course. It contains
- the BigBlueButton link for the live stream
- the recordings of the lectures
- a link to rocket-chat channel which can be used as a forum
-
find all the exercises here
-
instructions and possible topics for the project are here
If you find typos or even ways to improve readability or formatting, please feel free to make a pull request.
Extra credit toward your grade and (more importantly) a certificate will be given to
- who contributes the most to this repo
- the person with the tidiest solutions of the weekly exercises
as well as the team with
- the cleanest code in their project
- the most creative project
-
Convex Optimization: Algorithms and Complexity by Sébastien Bubeck (free online)
-
Introductory Lectures on Convex Programming by Yurii Nesterov