Conjugate Functions: Dual Programs

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Page 1 of 3

Optimization Techniques: Convexity in Machine Learning

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

Optimization Techniques: Convexity and Algorithms in Machine Learning

Covers optimization techniques in machine learning, focusing on convexity, algorithms, and their applications in ensuring efficient convergence to global minima.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Optimal Transport: Rockafellar Theorem

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

Convex Optimization

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

Conjugate Duality: Understanding Convex Optimization

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

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Faster Gradient Descent: Projected Optimization Techniques

Covers faster gradient descent methods and projected gradient descent for constrained optimization in machine learning.

Convex Optimization: Elementary Results

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

KKT for convex problems and Slater's CQ

Covers the KKT conditions and Slater's condition in convex optimization problems.