Modern convex optimization and applications (MoCCA'20)

Оптимизационная секция в рамках конференции "Moscow Conference on Combinatorics and Applications"

Расписание секции:

10:00 Pavel Dvurechensky (WIAS Berlin, MIPT, HSE) - Wasserstein barycenters from the computational perspective

10:35 Darina Dvinskikh (WIAS Berlin, MIPT) - Decentralized Algorithms for Wasserstein Barycenters

11:10 Eduard Gorbunov (MIPT, HSE) - MARINA: Faster Non-Convex Distributed Learning with Compression

11:35 Dmitry Kamzolov (MIPT) - Hyperfast Second-Order Local Solvers for Efficient Statistically Preconditioned Distributed Optimization

12:00 Artem Agafonov (MIPT) - Inexact Tensor Methods and Their Application to Stochastic Convex Optimization

12:30 Break

13:00 Aleksandr Beznosikov (MIPT, HSE) - On Disributed Saddle Point Problems

13:35 Alexander Rogozin (MIPT, HSE) - Decentralized optimization for saddle point problems with local and global variables

14:10 Egor Gladin (MIPT, Skoltech) - Vaidya's cutting plane method for stochastic optimization in small dimension

14:35 Alexander Titov (MIPT, HSE) - Some Modifications of Mirror Prox Algorithm for Strongly Monotone Variational Inequalities and Related Results

15:00 Seydamet Ablaev (CFU) - Adaptive Methods for Convex Optimization Problems with Relative Accuracy

Подробности на странице конференции.