Conjugate Functions: Dual Programs

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Page 3 of 3

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

Conjugate Duality: Envelope Representations and Subgradients

Explores envelope representations, subgradients, and the duality gap in convex optimization.

Lagrangian Duality: Convex Optimization

Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.

Subgradients and Convex Functions

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

Optimization Programs: Piecewise Linear Cost Functions

Covers the formulation of optimization programs for minimizing piecewise linear cost functions.

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.

Geodesic Convexity: Theory and Applications

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

Convex Optimization: Introduction and Sets

Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.