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, December 13, 2017 — 4:00 PM EST
Title: Generalized Conditional Gradient for Sparse Estimation
| Speaker: | Yaoliang Yu |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract:
We will be discussing the paper (bearing the same title) of Yaoliang Yu, Xinhua Zhang, and Dale Schuurmans. Structured sparsity is an important modelling tool that expands the applicability of convex formulations for data analysis, however it also creates significant challenges for efficient algorithm design.
Thursday, December 7, 2017 — 3:30 PM EST
Title: Continuous Quantum Walks and Symmetric Powers
| Speaker: | Chris Godsil |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
The k-th symmetric power of a graph X has the k-subsets of V(X) as its vertices, and two k-subsets are adjacent if their symmetric difference is an edge in X. A continuous quantum walk on a graph gives rise in a natural walk to walks on it symmetric powers.
Wednesday, December 6, 2017 — 4:00 PM EST
Title: Signal Recovery by Proximal Forward-Backward Splitting
| Speaker: | Shenghao Yang |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract:
We will be discussing the paper (bearing the same title) of Patrick Combettes and Valérie Wajs. We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties.
Friday, December 1, 2017 — 3:30 PM EST
Title: Turan problems for matroids
| Speaker: | Peter Nelson |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Given a fixed simple binary matroid N, what is the maximum size of a simple rank-r binary matroid that does not contain N a restriction?