Locations: * Rice University Mathematics Department Colloquium, Houston, TX Recently, Riemannian optimization (RO), the study of minimizing a cost function over a Riemannian manifold, exploded in popularity due to its many big data applications. A small sample of these popular applications includes metric learning, mixture model parameter estimation, covariance estimation and subspace recovery, and matrix completion. The typical manifold underlying an RO problem from data science can have a dimension numbered in the thousands or millions, if not higher. Algorithms that use only the objective function’s first-order differential information, called first-order methods, are particularly attractive for these problems due to their relatively low storage and iteration costs. This talk will start with an overview of the modern history of first-order methods in large-scale optimization on convex subsets of Euclidean space. Our aim is to provide an understanding of these methods and their attendant benefits in the simplest setting. Next, we will generalize these algorithms to the RO setting. Naturally, these broad generalizations entail challenges of commensurate difficulty to which we will pay special emphasis. In the final part of this talk, we describe modern developments in the theory of RO including the tangent subspace descent (TSD) framework, which generalizes block coordinate descent (BCD) methods to the RO setting.
