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

Home

Lecture

Introduction to Optimization

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (44)

Solving Linear Programs: SIMPLEX Method Log in to Mediaspace to watch this video

Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.

Linear Programming Basics Log in to Mediaspace to watch this video

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

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.

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.

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.

Convex Optimization Tutorial: KKT Conditions Log in to Mediaspace to watch this video

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

Two-phase Simplex Algorithm: Introduction and Duality Log in to Mediaspace to watch this video

Introduces the two-phase simplex algorithm and explores duality in linear programming.

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

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

Relations Between Events Log in to Mediaspace to watch this video

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Lagrangian Duality: Convex Optimization Log in to Mediaspace to watch this video

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

Lagrangian Duality: Theory and Applications Log in to Mediaspace to watch this video

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

Learning the Kernel Solution: MGT-418 Tutorial Log in to Mediaspace to watch this video

Explores learning the kernel solution in convex optimization, focusing on predicting outputs using a linear classifier and addressing possible numerical issues.

Newton's Method: Optimization Techniques Log in to Mediaspace to watch this video

Explores optimization techniques like gradient descent, line search, and Newton's method for efficient problem-solving.

Advanced Metaprogramming Queries: Code Volume & Complexity Log in to Mediaspace to watch this video

Explores managing large codebases, higher abstraction levels, CodeDB, Datalog queries, and program analysis.

Linear Programming Basics Log in to Mediaspace to watch this video

Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.

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 their performance.

RTR practical aspects + tCG Log in to Mediaspace to watch this video

Explores practical aspects of Riemannian trust-region optimization and introduces the truncated conjugate gradient method.

Gradient Descent Log in to Mediaspace to watch this video

Covers the concept of gradient descent, a universal algorithm used to find the minimum of a function.

Untitled Log in to Mediaspace to watch this video

Page 2 of 3