Lectures related to Convex Hulls: Complexity and Vertices

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.

Covers the concept of convex functions and their applications in optimization problems.

Covers the properties and operations of convex functions.