Convex Optimization: Exercises

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 1 of 3

Linear Programming: Weighted Bipartite Matching

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

Convex Optimization Tutorial: KKT Conditions

Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.

KKT and Convex Optimization

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

Convex Optimization Problems: Theory and Applications

Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.

KKT for convex problems and Slater's CQ

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

Lagrangian Duality: Convex Optimization

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

Optimization with Constraints: KKT Conditions

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

Convex Optimization: Self-dual Cones

Explores self-dual cones in convex optimization and their applications in various optimization problems.

Linear Programming Duality

Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.