Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Support Vector Machines: SVM Basics
Graph Chatbot
Related lectures (33)
Semi-Definite Programming
Log in to Mediaspace to watch this video
Covers semi-definite programming and optimization over positive semidefinite cones.
Optimization Principles
Log in to Mediaspace to watch this video
Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.
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.
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.
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.
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.
Optimization Problems: Path Finding and Portfolio Allocation
Log in to Mediaspace to watch this video
Covers optimization problems in path finding and portfolio allocation.
Support Vector Machines: Dual Formulation for Hard Margin
Log in to Mediaspace to watch this video
Explores the dual formulation of Support Vector Machines for hard margin classification.
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.
Dynamic Programming: Fibonacci Numbers
Log in to Mediaspace to watch this video
Covers dynamic programming with a focus on Fibonacci numbers and the rod cutting problem.
Max-Cut Problem: SDP Relaxation and Randomized Rounding
Log in to Mediaspace to watch this video
Explores the Max-Cut Problem, its relaxation using SDP, and Polynomial Optimization.
Graph Theory Basics
Log in to Mediaspace to watch this video
Introduces induced flows, basis matrices, and tree solutions in graph theory.
Untitled
Log in to Mediaspace to watch this video
Previous
Page 2 of 2
Next