Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Wednesday, July 28, 2021 — 10:00 AM EDT
Title: A primal-dual interior-point algorithm fo rnonsymmetric conic optimization
| Speaker: | Erling D. Andersen |
| Affiliation: | Mosek ApS |
| Zoom: | Register through The Fields Institute |
Abstract:
It is well known that primal-dual interior-point algorithms for linear optimization can easily be extended to the case of symmetric conic optimization, as shown by Nesterov and Todd (NT) in their 1997 paer about self-scaled barriers. Although many convex optimization problems can be expressed using symmetric cones then models involving for instance exponential functions do not belong to the class of symmetric conic optimization problems.
Friday, July 30, 2021 — 3:30 PM EDT
Title: Macdonald polynomials and the multispecies zero range process
| Speaker: | Olya Mandelshtam |
| Affiliation: | University of Waterloo |
| Zoom: | Please email Emma Watson |
Abstract:
Over the last couple of decades, the theory of special functions and symmetric functions have found unexpected connections to various interacting particle systems. Macdonald polynomials are a family of symmetric functions that are known to have remarkable connections to a well-studied particle model called the ASEP. It is natural to ask whether the modified Macdonald polynomials can be obtained using a combinatorial gadget for some other particle system.
Wednesday, August 11, 2021 — 10:00 AM EDT
Title: TBA
| Speaker: | Jacek Gondzio |
| Affiliation: | University of Edinburgh |
| Zoom: | Register through The Fileds Institute |
Abstract: TBA
Wednesday, August 11, 2021 — 11:00 AM EDT
Title: HiGHS: Theory, software and Impact
| Speaker: | Julian Hall |
| Affiliation: | University of Edinburgh |
| Zoom: | Register through The Fields Institute |
Abstract:
Since Dantzig formulated the simplex algorithm in 1947, the widespread need to solve linear optimization problems drove the development of algorithmic and computational techniques for decades, yielding several high performance commercial and open source software systems. This talk will focus on the Edinburgh-based work on solving large scale sparse linear programming problems that underpins the high performance open source linear optimization software, HiGHS, the challenges of developing such software, and the Impact that it has achieved.