Semidefinite Programming Courses and Certifications

Fields Institute

Workshop on Distance Geometry - Semidefinite Programming and Applications

Explore advanced mathematical techniques connecting distance geometry, semidefinite programming, and polynomial optimization through expert presentations and research insights.

• YouTube
• 14 hours 26 minutes
• On-Demand
• Free Video

Fields Institute

How Do Exponential Size Solutions Arise in Semidefinite Programming?

Explore the prevalence and implications of exponential size solutions in semidefinite programming, their impact on feasibility determination, and strategies for efficient representation.

• YouTube
• 50 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Fast Semidefinite Programming for Differentiable Combinatorial Optimization

Explore advanced techniques in semidefinite programming for combinatorial optimization, focusing on fast and differentiable methods presented by Carnegie Mellon expert Zico Kolter.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Scalable Semidefinite Programming

Discover a provably correct randomized algorithm for solving large semidefinite programming problems, reducing storage and arithmetic costs while effectively handling matrix variables with over 10^14 entries.

• YouTube
• 54 minutes
• On-Demand
• Free Video

GERAD Research Center

Global Optimization for Cardinality-Constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming

Explore global optimization techniques for cardinality-constrained minimum sum-of-squares clustering using semidefinite programming, focusing on exact algorithms and state-of-the-art approaches.

• YouTube
• 53 minutes
• On-Demand
• Free Video

Ryan O'Donnell

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.

• YouTube
• 32 minutes
• On-Demand
• Free Video

Ryan O'Donnell

The SDP Relaxation for Max-Cut - Lecture 19b of CS Theory Toolkit

Explore SDP relaxation for Max-Cut, transforming a quadratic program into a semidefinite program solvable by the Ellipsoid Algorithm. Part of CMU's graduate-level CS Theory Toolkit course.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Convex Optimization

7 reviews

Explore convex optimization techniques for engineering and scientific applications, covering theory, analysis, and practical problem-solving in various fields like signal processing and machine learning.

• edX
• 8 weeks, 10-15 hours a week
• On-Demand
• Free Online Course (Audit)

Fields Institute

Sensor Network Localization with Noisy Distance Measurements

Explore sensor network localization techniques using noisy distance measurements, including EDM problems, semidefinite programming, and nonlinear least-squares optimization for accurate node positioning.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Fields Institute

Distance Matrix Completions

Explores partial matrices, completions, and distance matrices, focusing on characterizing patterns for distance completable partial matrices and their geometric implications.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Nonsymmetric Conic Optimization and Dual Certificates for Sums-of-Squares

Explore nonsymmetric conic optimization methods as alternatives to semidefinite programming for sums-of-squares problems, including improved computational complexity and techniques for generating rigorous nonnegativity certificates.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Any-dimensional Polynomial Optimization

Explore a systematic approach to derive finite-sized semidefinite programming relaxations for bounding the limiting optimal value of any-dimensional polynomial optimization problems, with applications across multiple fields.

• YouTube
• 56 minutes
• On-Demand
• Free Video

BIMSA

The Moment-SOS Hierarchy and Its Applications

Explore the Moment-SOS hierarchy and its practical applications in optimization and polynomial systems through expert mathematical insights.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

Paul G. Allen School

Complexity of Finding Local Minima in Continuous Optimization

Exploring complexity of finding local minima in continuous optimization, focusing on polynomial problems. Discusses unconstrained and constrained cases, NP-hardness, and semidefinite programming equivalence.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

Simons Institute

Linear Programming and Semidefinite Programming in Coding Theory - An Incomplete Overview

Explore linear programming in coding theory, including MRRW and Levenshtein bounds, spherical codes, and connections to combinatorial objects. Discover recent advances in equiangular lines and energy bounds.

• YouTube
• 51 minutes
• On-Demand
• Free Video