Fast Algorithms via Convex Relaxation
2 047
48.7
Microsoft Research324 тыс
Следующее
09.03.18 – 3 16847:32Популярные
149 дней – 16 20140:37
276 дней – 1 8021:18Опубликовано 9 марта 2018, 19:32
In Theoretical CS many of the fastest algorithms are obtained by considering the Linear Programming (LP) relaxation of the problem. In this talk, I will survey several results on the effectiveness of employing the more general *convex* relaxation. We discovered that for a host of classical problems, their convex relaxation is often a more natural starting point to design fast algorithms. Examples include submodular minimization, market equilibrium computation and approximate Caratheodory. Our journey will involve some fun interplay of convex optimization with tools from discrete optimization and economics.
See more at microsoft.com/en-us/research/v...
See more at microsoft.com/en-us/research/v...
Свежие видео
7 дней – 1 6390:24
10 дней – 295 0370:58
11 дней – 1 1971:11
13 дней – 4 1180:59
16 дней – 3 2241:30
22 дня – 32 2818:43Случайные видео
40 дней – 64 3500:13
233 дня – 14 2050:26
329 дней – 29 7546:03
20.06.23 – 20 3420:21
19.11.22 – 943 8439:14
30.12.07 – 13 8326:46
6 дней – 56 56715:30
7 дней – 1 2090:47
7 дней – 44330:07
7 дней – 8280:31
8 дней – 2 265 6898:16
9 дней – 3 4800:16
