Lecture
Conjugate Duality: Envelope Representations and Subgradients
Related lectures (49)
Optimal Transport: Rockafellar Theorem
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
Convex Functions
Covers the properties and operations of convex functions.
Geodesic Convexity: Theory and Applications
Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.
Convex Optimization: Gradient Descent
Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.
Convex Optimization: Conjugate Duality
Explores envelope representations, subgradients, conjugate functions, duality gap, and strong duality in convex optimization.
Convex Optimization
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Harmonic Forms and Riemann Surfaces
Explores harmonic forms on Riemann surfaces, covering uniqueness of solutions and the Riemann bilinear identity.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Convex Optimization
Introduces the fundamentals of convex optimization, emphasizing the significance of convex functions in simplifying the minimization process.