Lecture
Subgradients and Convex Functions
Related lectures (27)
Mathematics of Data: Optimization Basics
Covers basics on optimization, including norms, Lipschitz continuity, and convexity concepts.
Convex Optimization
Introduces the fundamentals of convex optimization, emphasizing the significance of convex functions in simplifying the minimization process.
Convex Functions
Covers the properties and operations of convex functions.
Convex Optimization
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.
Vector Differentiation and Convex Functions
Covers the concepts of vector differentiation and convex functions.
Linear Algebra Review: Convex Optimization
Covers essential linear algebra concepts for convex optimization, including vector norms, eigenvalue decomposition, and matrix properties.
Optimal Transport: Rockafellar Theorem
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
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.
Convexity and Jacobians
Explores convexity, Jacobians, subdifferentials, and convergence rates in optimization and function analysis.