The course is intended for students having completed bachelor studies.
Time and place
Tuesday 14:00-15:30, PWR 55.03
Thursday 15:45-17:15, PWR 9.41
The course provides an in-depth treatment of classical and modern concepts in convex optimization (with emphasis on the latter) that are relevant in control, decision making and data science problems. The course articulates around the following four topics:
- Basics of convex analysis
- Operator-splitting methods
- Distributed optimization
- Online convex optimization
After an introductory part covering classic and foundational concepts in convex optimization (convex sets and functions; Lagrangian and Fenchel duality; gradient and coordinate descent methods), we will focus on three state-of-the-art topics in convex optimization.
Operator-splitting methods are first-order methods based on monotone operator theory that are particularly suitable to handle non-smooth problems (often arising in control and learning applications). Distributed optimization allows large-scale problems (appearing e.g. in learning-from-big-data and distributed control settings) to be solved by means of local computations and is a central paradigm for the development of network infrastructures (e.g. smart cities, swarm robotics). Online convex optimization is a paradigm for sequential decision making problems where an agent needs to take decisions by solving a series of optimization problems online, thus requiring real-time capable computations and means to take action in the face of uncertainty.
The course is not aimed at teaching the use of specific optimization toolbox or software. Conversely, emphasis will be placed on methodological aspects such as: design principles behind the algorithms; properties of the methods and mathematical tools required to prove them; understanding of the most important features of state-of-the-art algorithms used in applications.
The course is given in English.
- S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
- J.-B. Hiriart-Urruty and C. Lemaréchal. Fundamentals of Convex Analysis. Springer, Berlin, 2001.
- J. Nocedal and S. J. Wright. Numerical Optimization. Springer, New York, 2006.
- H. H. Bauschke and P. L. Combettes. Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York, 2011.
- A. Beck. First-Order Methods in Optimization, SIAM, 2017.
- G. Notarstefano, I. Notarnicola, A. Camisa. Distributed Optimization for Smart Cyber-Physical Networks, Foundations and Trends in Systems and Control, 2019.
- E. Hazan. Introduction to Online Convex Optimization, Foundations and Trends in Optimization, 2016.
The exam will be an "open-book exam" (i.e., all non-electronic resources are permitted) and will last 120 minutes.
Andrea IannelliProf. Dr.
Trustworthy Autonomy for Smart Adaptive Systems
[Photo: Wolfram Scheible]