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

Home

Lecture

SVM for Non-separable Datasets

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (50)

Optimal Decision Making: Exercises and Applications Log in to Mediaspace to watch this video

Covers exercises on optimal decision making, including minimizing costs and optimizing transportation networks.

Semi-Definite Programming Log in to Mediaspace to watch this video

Covers semi-definite programming and optimization over positive semidefinite cones.

Simplex Method: Basics and Applications Log in to Mediaspace to watch this video

Covers the basics of the Simplex method and its application in solving optimization problems.

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.

Convex Optimization: Exercises Log in to Mediaspace to watch this video

Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.

Convexifying Nonconvex Problems: SVM and Dimensionality Reduction Log in to Mediaspace to watch this video

Explores convexifying nonconvex problems through SVM and dimensionality reduction techniques.

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.

ALM with Inequalities: Next Steps in Optimization Log in to Mediaspace to watch this video

Explores the Augmented Lagrangian Method with equality and inequality constraints in optimization, emphasizing the importance of slack variables.

Polynomial Optimization: SOS and SDP Log in to Mediaspace to watch this video

Explores Sum of Squares polynomials and Semidefinite Programming in Polynomial Optimization, enabling the approximation of non-convex polynomials with convex SDP.

Optimization Principles Log in to Mediaspace to watch this video

Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.

Markov Chain Monte Carlo: Sampling High-Dimensional Distributions Log in to Mediaspace to watch this video

Covers Markov Chain Monte Carlo for sampling high-dimensional distributions, discussing challenges, advantages, and applications like the Knapsack Problem and cryptography.

Optimization Problems: Path Finding and Portfolio Allocation Log in to Mediaspace to watch this video

Covers optimization problems in path finding and portfolio allocation.

Lasso and MNIST Basics Log in to Mediaspace to watch this video

Introduces Lasso regularization and its application to the MNIST dataset, emphasizing feature selection and practical exercises on gradient descent implementation.

Linear Optimization: Fundamentals Log in to Mediaspace to watch this video

Covers the basics of linear optimization, including equations, polyhedrons, feasible directions, and optimal solutions.

International Portfolio Allocation Log in to Mediaspace to watch this video

Explores the optimization of international portfolio allocation and the principles of comparative advantage in trade.

Simplex Method: Phase 2 Log in to Mediaspace to watch this video

Delves into the second phase of the simplex method, emphasizing matrix operations for solving optimization problems with constraints.

Linear Programming Basics Log in to Mediaspace to watch this video

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

Faster Gradient Descent: Projected Optimization Techniques Log in to Mediaspace to watch this video

Covers faster gradient descent methods and projected gradient descent for constrained optimization in machine learning.

Duality: Economic Interpretation Log in to Mediaspace to watch this video

Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.

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

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

Page 2 of 3