Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, November 30, 2018 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Merve Bodur

Title: Aggregation-based cutting-planes for packing and covering integer programs

Speaker: Merve Bodur
Affiliation: University of Toronto
Room: MC 5501

Abstract:

We study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs).

Wednesday, December 5, 2018 4:00 pm - 4:00 pm EST (GMT -05:00)

Continuous Optimization Seminar - Shenghao Yang

Title: Stochastic subgradient method converges on tame functions

Speaker: Shenghao Yang
Affiliation: University of Waterloo
Room: MC 5479

Abstract: In this talk, I will present a paper (https://arxiv.org/abs/1804.07795) on the convergence of stochastic subgradient method in a nonconvex and nonsmooth setting.

Tuesday, January 22, 2019 2:00 pm - 2:00 pm EST (GMT -05:00)

Reading Group - Graph Theory

Title: Announcing new Reading Group this term on the topic of "Entropy and Counting"

Speaker: Various/TBD
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

A new Reading Group will be starting this term on the topic of "Entropy and Counting". The talks will take place weekly on Tuesdays from 2:00 p.m. to 3:00 p.m. in MC 6486 starting on Jan 22th.

Friday, January 25, 2019 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Mehdi Karimi

Title: Convex Optimization Problems in Domain-Driven Form

Speaker: Mehdi Karimi
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

In this talk, we introduce the Domain-Driven form for convex optimization problems and show how general it is by several examples; including LP, SDP, geometric and entropy programming, and quantum entropy optimization.

Wednesday, January 30, 2019 3:30 pm - 3:30 pm EST (GMT -05:00)

Graphs and Matroids- Tom Kelly

Title: Fractional coloring with local demands

Speaker: Tom Kelly
Affiliation: University of Waterloo
Room: MC 6486

Abstract: In a fractional coloring, vertices of a graph are assigned subsets of the $[0, 1]$-interval such that adjacent vertices receive disjoint subsets.