Revisiting Tardos’s Framework for Linear Programming - Faster Exact Solutions using Approximate Solvers

Revisiting Tardos’s Framework for Linear Programming - Faster Exact Solutions using Approximate Solvers

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Proximity theorem

10 of 14

10 of 14

Proximity theorem

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Revisiting Tardos’s Framework for Linear Programming - Faster Exact Solutions using Approximate Solvers

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Linear Programming
  3. 3 Weakly vs Strongly Polynomial Algorithms for
  4. 4 Fast Weakly Polynomial Algorithms for LP
  5. 5 Strongly Polynomial Algorithms for LP
  6. 6 Dependence on the constraint matrix only
  7. 7 Tardos's framework: variable fixing
  8. 8 Our contributions: Dadush-N.-Végh '20
  9. 9 The condition number A
  10. 10 Proximity theorem
  11. 11 Variable fixing for feasibility
  12. 12 The lifting operation
  13. 13 The feasibility algorithm
  14. 14 Optimization algorithm

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.