Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Untitled
Graph Chatbot
Related lectures (31)
KKT Conditions: Convex Optimization
Explores the KKT conditions in convex optimization, including dual cones, SDP duality, and convex hulls.
Convexity: Functions and Global Minima
Explores convex functions, global minima, and their relationship with differentiability.
Optimal Transport: Gradient Flows in Rd
Explores optimal transport and gradient flows in Rd, emphasizing convergence and the role of Lipschitz and Picard-Lindelöf theorems.
Conjugate Duality: Understanding Convex Optimization
Explores conjugate duality in convex optimization, covering weak and supporting hyperplanes, subgradients, duality gap, and strong duality conditions.
Convex Optimization: Theory and Applications
Explores convex optimization theory, covering local and global minima, convex functions, and applications in various fields.
Convex Optimization: Epigraphs
Explores epigraphs, convexity of bivariate functions, and log-sum-exp functions in convex optimization.
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.
KKT for convex problems and Slater's CQ
Covers the KKT conditions and Slater's condition in convex optimization problems.
Conjugate Duality: Envelope Representations and Subgradients
Explores envelope representations, subgradients, and the duality gap in convex optimization.
Geodesically Convex Optimization
Covers geodesically convex optimization on Riemannian manifolds, exploring convexity properties and minimization relationships.
Convex Optimization
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.
Previous
Page 2 of 2
Next