Title:
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
| dc.contributor.author | Hansen, Thomas Dueholm | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. Algorithms, Randomness and Complexity Center | en_US |
| dc.contributor.corporatename | Aarhus universitet | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Mathematics | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Computer Science | en_US |
| dc.date.accessioned | 2011-11-30T21:06:59Z | |
| dc.date.available | 2011-11-30T21:06:59Z | |
| dc.date.issued | 2011-11-11 | |
| dc.description | Presented on November 11, 2011 in Klaus 1116 | en_US |
| dc.description | Runtime: 62:08 minutes | en_US |
| dc.description.abstract | The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most deterministic pivoting rules are known, however, to need an exponential number of steps to solve some linear programs (Klee-Minty examples). No non-polynomial lower bounds on the expected number of steps were known, prior to this work, for randomized pivoting rules. We provide the first subexponential (i.e., of the form 2^(Omega(n^alpha)), for some alpha>0) lower bounds for the two most natural, and most studied, randomized pivoting rules suggested to date. Joint work with Oliver Friedmann and Uri Zwick. | en_US |
| dc.format.extent | 62:08 minutes | en_US |
| dc.identifier.uri | http://hdl.handle.net/1853/42026 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.relation.ispartofseries | ARC Theory Day | en_US |
| dc.subject | Simplex algorithm | en_US |
| dc.title | Subexponential lower bounds for randomized pivoting rules for the simplex algorithm | en_US |
| dc.type | Moving Image | |
| dc.type.genre | Lecture | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | Algorithms and Randomness Center | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | ARC Theory Day | |
| relation.isOrgUnitOfPublication | b53238c2-abff-4a83-89ff-3e7b4e7cba3d | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | 7019ba80-e025-4641-8487-0f848ed1e1c3 |
Files
Original bundle
1 - 3 of 3
No Thumbnail Available
- Name:
- hansen.mp4
- Size:
- 168.27 MB
- Format:
- MP4 Video file
- Description:
- Download Video
No Thumbnail Available
- Name:
- hansen_videostream.html
- Size:
- 985 B
- Format:
- Hypertext Markup Language
- Description:
- Streaming Video
No Thumbnail Available
- Name:
- Transcription.txt
- Size:
- 45.03 KB
- Format:
- Plain Text
- Description:
- Transcription