Lecture

Constrained Convex Optimization: Min-Max Formulation and Fenchel Conjugation

Related lectures (31)

Optimization with Constraints: KKT Conditions

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

Equivalent formulation

Covers the concept of equivalent formulation in constrained optimization and explores the tangent cone.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Mathematics of Data: Optimization Basics

Covers basics on optimization, including norms, Lipschitz continuity, and convexity concepts.

Fenchel Conjugation: Basics and Applications

Introduces Fenchel conjugation, exploring its properties, examples, and applications in nonsmooth optimization problems and minimax formulations.

Optimal Control: Unconstrained and Constrained Problems

Explores optimal control in unconstrained and constrained problems, emphasizing the importance of sparsity.

Optimization with Constraints: KKT Conditions

Covers the optimization with constraints, focusing on the Karush-Kuhn-Tucker (KKT) conditions.

Introduction to Optimization

Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Lagrange Multipliers Theorem

Explores the Lagrange multipliers theorem for n>2, demonstrating its application in optimization problems with constraints.

Cones of convex sets

Explores optimization on convex sets, including KKT points and tangent cones.

KKT for convex problems and Slater's CQ

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

KKT and Convex Optimization

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

Weak and Strong Duality

Covers weak and strong duality in optimization problems, focusing on Lagrange multipliers and KKT conditions.

Optimisation in Energy Systems

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.

Linear Optimization: Finding Initial BFS

Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.

Optimization Techniques: Stochastic Gradient Descent and Beyond

Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.

Kernel SVM: Polynomial Expansion & Cover's Theorem

Explores polynomial expansion, high-dimensional spaces, Cover's Theorem, Lagrangian formulation, and practical SVM applications.

Duality: Duality in Linear Optimization

Covers the concept of linear optimization and the duality relationship between primal and dual problems.

Optimization Framework: Inequality Constraints

Covers an optimization framework with inequality constraints and Karush-Kahn Tucker conditions.