Lecture 5. Course "Modern Algorithmic Optimization" (Yuriy Nesterov)

614 views · Published 26 May 2018 · 1:49:48 · Indexed 31 October 2026

Channel: ФКН ВШЭ · 2018 · Education

Watch on YouTube

In this course, we present the most important research directions in modern optimization theory. The main topics of our interest are related to the provable complexity of optimization problems and the most efficient methods for finding their approximate solution.  Attention will be given to the methods for solving problems of large and super-large dimensions, which arise in many engineering applications, telecommunications, and models for analyzing Internet activity. We consider also the optimization schemes, which are necessary for justifying the rationality of consumers in economic models.

During the course, we are going to discuss the following topics:
- The complexity of optimization problems
- Universal first-order methods
- Second-order methods. Systems of nonlinear equations
- Looking into the black box: smoothing technique
- Looking into the black box: interior-point methods
- Optimization with relative accuracy
- Solving the huge-scale optimization problems
- Algorithmic models of human behaviour

Lecturer: Professor Yuriy Nesterov, HSE University, Catholic University of Leuven.

Faculty of Computer Science: https://cs.hse.ru/en/
Follow us: https://www.facebook.com/hsefcs; https://twitter.com/CS_HSE

More from this channel