Conjugate Functions: Dual Programs

Related lectures (28)

Page 2 of 3

Covers convex optimization problems and gradient-based algorithms to find the global minimum.

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

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

Discusses proximal gradient descent and its applications in optimizing machine learning algorithms.

Explores convex optimization theory, covering local and global minima, convex functions, and applications in various fields.

Provides an overview of optimization techniques, focusing on gradient descent and properties of convex functions in machine learning.

Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.

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

Delves into linear optimization formulation, capacity expansion, investment under taxation, and revenue management in various industries.

Discusses proximal and subgradient descent methods for optimization in machine learning.