Convex Optimization Problems: Theory and Applications

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.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

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.

Convex Optimization Problems: Standard Form

Covers convex optimization problems, transformation to standard form, and optimality criteria for differentiable objectives.

Optimization Problems: Standard Form

Explores optimization problems in standard form, convex optimization, and optimality criteria.

KKT and Convex Optimization

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

Optimization Methods: Theory Discussion

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

Lagrangian Duality: Theory and Applications

Explores Lagrangian duality in convex optimization, discussing strong duality, dual solutions, and practical applications in second-order cone programs.

Lagrangian Duality: Convex Optimization

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

Optimal Decision Making: Sensitivity Analysis

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.