##### Department of Mathematics,

University of California San Diego

****************************

### Math 278C - Optimization and Data Science Seminar

## Mareike Dressler

#### UC San Diego

## Multiple typical ranks in matrix completion

##### Abstract:

In a matrix completion problem, one has access to a subset of entries of a matrix and wishes to determine the missing entries subject to some constraint (e.g. a rank bound). Such problems appear in computer vision, collaborative filtering, and many other applications. In this talk, I will discuss how certain notions from nonlinear algebra can be used to understand the structure underlying various types of matrix completion problems.

Host: Jiawang Nie

### May 5, 2021

### 3:00 PM

### Meeting ID: 982 9781 6626 Password: 278CSP21

****************************