Fast Algorithms via Convex Relaxation

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Covers fast algorithms obtained through convex relaxation techniques. Teaches how relaxation methods enable efficient solutions to difficult optimization problems.

A 73-minute video from Microsoft Research: “Fast Algorithms via Convex Relaxation”.

Video by Microsoft Research, played through YouTube's embedded player.

Part of Candidate Talk