Graph algorithms through the lens of continuous optimization

Adrian Vladu
IRIF, Université de Paris

Date(s) : 03/07/2020   iCal
14 h 00 min - 15 h 00 min

Recent years have witnessed a surge in the development of fast graph algorithms based on continuous optimization primitives. Classically, graph algorithms have relied on purely combinatorial techniques. However, new ideas stemming from Scientific Computing and Machine Learning set forth an emerging theme of algorithm design via continuous optimization. I will provide a tour through some of the techniques that underlie this theme, and show how they can be used to obtain fast algorithms for solving a range of fundamental problems such as: maximum flow, minimum cost flow, or optimal transport with entropic regularization.
This talk is based on,, and, but will be kept self-contained, and will assume no prior background in optimization.

This seminar is organized by LIS, pole Calcul. Link of the visio:


Retour en haut 

Secured By miniOrange