A new virtual lecture series from the Department of Combinatorics and Optimization and The Fields Institute, featuing one hour lectures on research in theory and applications of optimization with an emphasis on continuous optimization.
Topics will range from linear and quadratic programming, convex and general nonlinear programming, with a focus on semidefinite optimization as well as non-smooth, and set-valued and variational analysis. Included are first order and proximal point methods and their applications in the areas of data science and machine learning.
To receive the Zoom links to view the series you must register through The Fields Institute; this one time registration will create a subscription for you to recieve the links throughout the series.