Optimal Transport: Convexity and Inequalities

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Conjugate Duality: Understanding Convex Optimization

Explores conjugate duality in convex optimization, covering weak and supporting hyperplanes, subgradients, duality gap, and strong duality conditions.

Minkowski's Theorems: Lattices and Volumes

Explores Minkowski's theorems on lattices, volumes, and set comparisons.

Convex Sets and Functions

Introduces convex sets and functions, discussing minimizers, optimality conditions, and characterizations, along with examples and key inequalities.

Optimization Techniques: Gradient Descent and Convex Functions

Provides an overview of optimization techniques, focusing on gradient descent and properties of convex functions in machine learning.

Convex Optimization: Sets and Functions

Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.

Proximal Gradient Descent: Optimization Techniques in Machine Learning

Discusses proximal gradient descent and its applications in optimizing machine learning algorithms.

Convex Functions

Covers the properties and operations of convex functions.

Compact Sets and Extreme Values

Explores compact sets, extreme values, and function theorems on bounded sets.

Approximation of Zeta Function

Explores the approximation of the zeta function using compact functions and spectral decomposition.

Page 2 of 2