Conjugate Duality: Envelope Representations and Subgradients

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 3 of 3

Explores subgradients in convex functions, emphasizing non-differentiable yet convex scenarios and properties of subdifferentials.

Geodesic Convexity: Theory and Applications

Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.

Convex Optimization

Introduces the fundamentals of convex optimization, emphasizing the significance of convex functions in simplifying the minimization process.

Optimization with Constraints: KKT Conditions

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

Convex Sets: MGT-418 Lecture

On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.

KKT Conditions: Convex Optimization

Explores the KKT conditions in convex optimization, including dual cones, SDP duality, and convex hulls.

Convex Optimization: Examples of Convex Functions

Explores convex optimization, convex functions, and their properties, including strict convexity and strong convexity, as well as different types of convex functions like linear affine functions and norms.

Faster Gradient Descent: Projected Optimization Techniques

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

Linear Programming Techniques in Reinforcement Learning

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.