Convex Geometry: Brunn-Minkowski Inequality

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 3 of 3

Convex Functions: Theory and Applications

Introduces convex functions, covering affine, convex, and conic hulls, transformations, inequalities, and conditions for convexity.

Optimal Transport: Theory and Applications

Explores Lagrange multipliers, minimax theorems, and convex subsets in optimal transport theory.

Convex Optimization

Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.

Projected Gradient Descent

Explores convex constrained optimization through Projected Gradient Descent, focusing on tangent space and iterative minimization.

Conjugate Duality: Understanding Convex Optimization

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

Clustering: K-Means

Covers clustering and the K-means algorithm for partitioning datasets into clusters based on similarity.

Convex Optimization: Introduction and Sets

Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.

Convex Optimization: Epigraphs

Explores epigraphs, convexity of bivariate functions, and log-sum-exp functions in convex optimization.

Conjugate Duality: Envelope Representations and Subgradients

Explores envelope representations, subgradients, and the duality gap in convex optimization.

KKT for convex problems and Slater's CQ

Covers the KKT conditions and Slater's condition in convex optimization problems.