Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Conjugate Duality: Envelope Representations and Subgradients
Graph Chatbot
Related lectures (33)
Optimization Techniques: Convexity in Machine Learning
Covers optimization techniques in machine learning, focusing on convexity and its implications for efficient problem-solving.
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.
Fenchel Conjugation: Basics and Applications
Introduces Fenchel conjugation, exploring its properties, examples, and applications in nonsmooth optimization problems and minimax formulations.
Subgradients and Convex Functions
Explores subgradients in convex functions, emphasizing non-differentiable yet convex scenarios and properties of subdifferentials.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.
Convex Optimization: Conjugate Duality
Log in to Mediaspace to watch this video
Explores envelope representations, subgradients, conjugate functions, duality gap, and strong duality in convex optimization.
Conjugate Duality: Understanding Convex Optimization
Log in to Mediaspace to watch this video
Explores conjugate duality in convex optimization, covering weak and supporting hyperplanes, subgradients, duality gap, and strong duality conditions.
Optimal Transport: Rockafellar Theorem
Log in to Mediaspace to watch this video
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
Convex Optimization: Convex Functions
Log in to Mediaspace to watch this video
Covers the concept of convex functions and their applications in optimization problems.
KKT and Convex Optimization
Log in to Mediaspace to watch this video
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Convex Optimization: Gradient Descent
Log in to Mediaspace to watch this video
Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.
Convex Optimization
Log in to Mediaspace to watch this video
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.
Convex Optimization: Elementary Results
Log in to Mediaspace to watch this video
Explores elementary results in convex optimization, including affine, convex, and conic hulls, proper cones, and convex functions.
Convex Optimization: Sets and Functions
Log in to Mediaspace to watch this video
Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.
KKT for convex problems and Slater's CQ
Log in to Mediaspace to watch this video
Covers the KKT conditions and Slater's condition in convex optimization problems.
Convex Optimization
Log in to Mediaspace to watch this video
Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.
Optimization Techniques: Convexity and Algorithms in Machine Learning
Log in to Mediaspace to watch this video
Covers optimization techniques in machine learning, focusing on convexity, algorithms, and their applications in ensuring efficient convergence to global minima.
Convex Sets: Mathematical Optimization
Log in to Mediaspace to watch this video
Introduces convex optimization, covering convex sets, solution concepts, and efficient numerical methods in mathematical optimization.
Convex Optimization: Theory and Applications
Log in to Mediaspace to watch this video
Explores convex optimization theory, covering local and global minima, convex functions, and applications in various fields.
Convex Optimization: Gradient Algorithms
Log in to Mediaspace to watch this video
Covers convex optimization problems and gradient-based algorithms to find the global minimum.
Previous
Page 1 of 2
Next
