Convex Geometry: Brunn-Minkowski Inequality

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 2 of 3

Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.

Geodesically Convex Optimization

Covers geodesically convex optimization on Riemannian manifolds, exploring convexity properties and minimization relationships.

Convexity: Functions and Global Minima

Explores convex functions, global minima, and their relationship with differentiability.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Regular Polyhedra: Definitions and Symmetries

Explores the definitions and symmetries of regular polyhedra, focusing on the five known convex regular polyhedra from ancient times.

Convex Sets: Mathematical Optimization

Introduces convex optimization, covering convex sets, solution concepts, and efficient numerical methods in mathematical optimization.

Convex Optimization: Sets and Functions

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

The Hidden Convex Optimization Landscape of Deep Neural Networks

Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.

Optimal Transport: Convexity and Inequalities

Explores optimal transport, emphasizing convexity properties and inequalities in compact sets.