Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games

Association for Computing Machinery (ACM) via YouTube

Overview

Explore an advanced cutting plane method for convex optimization and convex-concave games in this 24-minute conference talk presented at an Association for Computing Machinery (ACM) event. Delve into the setup of the cutting plane method, examine the speaker's results, and understand the role of separation oracles. Trace the historical development of cutting plane methods before diving into a simplified version of the Vaidya 89 algorithm. Analyze runtime bottlenecks and maintenance challenges, with a focus on leverage score maintenance. Discover a multi-layered data structure approach and its implications for the Matrix Multiplication Zoo. Investigate more general cutting plane methods and their practical applications. Conclude with a Q&A session to address any remaining questions on this sophisticated optimization technique.

Syllabus

Intro
Cutting plane method: the setup
Our result Separation oracle
History of cutting plane method
Oversimplified Vaidya 89 algorithm
The runtime bottleneck
Maintenance problem
Leverage score maintenance: the challenge
A multi-layered data structure
Matrix Multiplication Zoo
More General Cutting Plane Method
Applications
Questions?

Taught by

Association for Computing Machinery (ACM)

Reviews

Start your review of An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.