Casey Garner will talk about; 'General Matrix Optimization'

Since our early days in mathematics, we have been aware of two important characteristics of a matrix, namely, its coordinates and its spectrum. We have also witnessed the growth of matrix optimization models from matrix completion to semidefinite programming; however, only recently has the question of solving matrix optimization problems with general spectral and coordinate constraints been studied. In this talk, we shall discuss recent work done to study these general matrix optimization models and how they relate to topics such as Riemannian optimization, approximation theory, and more.