YoVDO

IPM and Nested Dissection for Planar and Separable LPs

Offered By: Simons Institute via YouTube

Tags

Interior-Point Methods Courses Linear Programming Courses Algorithm Design Courses Data Structures Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 28-minute lecture on incorporating nested dissection-based data structures into the Interior Point Method (IPM) framework for efficient Linear Programming (LP) solvers. Delve into applications for planar min-cost flow, planar k-multicommodity flow, LPs with low treewidth, and general separable LPs. Learn how these techniques enhance optimization algorithms for various problem types. Gain insights from Sally Dong of the University of Washington as she presents this talk as part of the Optimization and Algorithm Design series at the Simons Institute.

Syllabus

IPM and Nested Dissection for Planar and Separable LPs


Taught by

Simons Institute

Related Courses

Convex Optimization
Stanford University via edX Continuous Algorithms - Sampling and Optimization in High Dimension
Simons Institute via YouTube Interior Point Methods
Simons Institute via YouTube On the Computability of Continuous Maximum Entropy Distributions with Applications
Association for Computing Machinery (ACM) via YouTube Recent Advances in Iterative Solvers for Interior Point Methods
Fields Institute via YouTube