Calendar
Posted August 27, 2026
Discussion and Training in Combinatorics
2:30 pm – 3:30 pm Lockett 233
Joy Harris
Intro to Graphs and Matroids
We will give a brief introduction to both Matroid Theory and Graph Theory. From the basic ideas of linear independence, we will define, in many equivalent ways, matroids derived from matrices. We will then discuss core definitions of Graph Theory, important properties and classes, and the way that all graphs give rise to matroids.
Event contact: Sean Boros
Posted August 26, 2026
Informal Analysis Seminar Questions or comments?
12:30 pm – 1:20 pm Lockett 233
Christopher Bunting, LSU
TBD (Navier-Stokes SDEs)
Event contact: Laura Kurtz
Posted August 27, 2026
Informal Geometry and Topology Seminar Questions or comments?
3:30 pm Lockett Hall 233
Fabian Espinoza de Osambela, Louisiana State University
TBD
TBD
Posted August 23, 2026
Last modified August 24, 2026
Control and Optimization Seminar Questions or comments?
10:30 am – 11:20 am Zoom: https://lsu.zoom.us/j/98176468969
Heinz Bauschke, University of British Columbia, Canada
SIAM Fellow
On the Strong Convergence of Some Optimization Algorithms in the Linear Case
Many algorithms in optimization generate a sequence that converges weakly to a solution. Under linearity assumptions, sometimes one obtains more: strong convergence and a formula for the limit. In this talk, I will report on recent work (joint with Sedi Bartz, Yuan Gao, and Walaa Moursi) on the classical KM method and some accelerated algorithms.