Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Lecture

Convex Relaxation in Optimization

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (37)

Branch & Bound: Optimization Log in to Mediaspace to watch this video

Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.

Linear Programming Basics Log in to Mediaspace to watch this video

Covers deriving basic linear program representation, finding solutions, and exploring optimality.

Network Flows and LP Formulations Log in to Mediaspace to watch this video

Explains network flows, LP formulations, simplex method, duality, and practical applications.

Optimization Programs: Piecewise Linear Cost Functions Log in to Mediaspace to watch this video

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

Linear Programming: Solving LPs Log in to Mediaspace to watch this video

Covers the process of solving Linear Programs (LPs) using the simplex method.

Cutset Formulation: MST Problem Log in to Mediaspace to watch this video

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Optimization Problems: Standard Form Log in to Mediaspace to watch this video

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

Convex Optimization Problems: Theory and Applications Log in to Mediaspace to watch this video

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

Linear Optimization: Auxiliary Problem Log in to Mediaspace to watch this video

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Weak and Strong Duality Log in to Mediaspace to watch this video

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

Two-Stage Stochastic Programs Log in to Mediaspace to watch this video

Explores Two-Stage Stochastic Programs, problem reformulation, Benders decomposition, extreme points, and sensitivity analysis.

Convex Optimization: Self-dual Cones Log in to Mediaspace to watch this video

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

Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search Log in to Mediaspace to watch this video

Explores solving Connect Four using game theory algorithms and compares Alpha-Beta pruning with Monte-Carlo tree search.

Dataflow Analysis: Optimization Log in to Mediaspace to watch this video

Explores dataflow analysis for optimization, including equations solving, live variables, reaching definitions, and very busy expressions.

Subquadratic Attention Mechanisms: State Space Models Overview Log in to Mediaspace to watch this video

Covers subquadratic attention mechanisms and state space models, focusing on their theoretical foundations and practical implementations in machine learning.

Fixing Serverless Computing with Open-Source Hardware Log in to Mediaspace to watch this video

Explores challenges and solutions in serverless computing, focusing on energy usage, cloud utilization, FaaS architecture, and performance analysis.

Zero-Sum Games: Concepts and Applications Log in to Mediaspace to watch this video

Covers zero-sum games, focusing on Nash equilibria, security strategies, and their applications in various scenarios.

Page 2 of 2