Conjugate Duality: Envelope Representations and Subgradients

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 1 of 3

Explores envelope representations, subgradients, conjugate functions, duality gap, and strong duality in convex optimization.

Conjugate Duality: Understanding Convex Optimization

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

Optimal Transport: Rockafellar Theorem

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Convex Optimization: Convex Functions

Covers the concept of convex functions and their applications in optimization problems.

KKT and Convex Optimization

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

Convex Optimization: Gradient Descent

Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.

Convex Optimization

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

Convex Optimization: Elementary Results

Explores elementary results in convex optimization, including affine, convex, and conic hulls, proper cones, and convex functions.

Convex Optimization: Sets and Functions

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

Optimization Techniques: Convexity in Machine Learning

Covers optimization techniques in machine learning, focusing on convexity and its implications for efficient problem-solving.