Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, September 15, 2022, 12:15 pm

Duration: 30 minutes

Location: CAB G 56

Speaker: Alex Black (UC Davis)

Small Shadows of Lattice Polytopes

For 75 years, the simplex method has remained one of the most popular methods for solving linear programs, yet much still remains mysterious about its performance. Geometrically, the simplex method optimizes a linear function by tracing a path on the oriented graph of a polyhedron, and the simplex method may only run quickly if this graph has small diameter. It is a fundamental open question to understand whether polyhedra are guaranteed to have polynomially bounded diameters. However, even in cases in which we know bounds on diameters, actually following such short paths with the simplex method has continued to be an additional challenge. I will talk about my recent joint work with Jesús De Loera, Sean Kafer, and Laura Sanità on finding pivot rules for the simplex method guaranteed to match the theoretical best possible bound on diameters for 0/1-polytopes as well as my work on nearly matching the best known bounds for lattice polytopes.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login