Recent progress on the polytope diameter bounds I will give a brief overview of ongoing work with Schewe, Deza, and Hua on a computational attack on the Hirsch conjecture. I will discuss in particular a few specific bounds on the
Katya Scheinberg, Columbia University
Self-correcting geometry in model based derivative-free optimization Several efficient methods for derivative-free optimization (DFO) are based on the construction and maintenance of an interpolation model for the objective function. Most of these algorithms use special “geometry-improving” iterations, where the geometry
Adrian Burlacu, McMaster University
Face Lattice Computation Under Symmetry The last 15 years have seen a significant progress in the development of general purpose algorithms and software for polyhedral computation. Many polytopes of practical interest have enormous output complexity and are often highly degenerate,