Collection Geometry of Nonnegative Matrix Rank
One of many deﬁnitions gives the rank of an m x n matrix M as the smallest natural number r such that M can be factorized as AB, where A and B are m x r and r x n matrices respectively. In many applications, we are interested in factorizations of a particular form. For example, factorizations with nonnegative entries deﬁne the nonnegative rank which is notion that is used in data mining applications, statistics, complexity theory etc. We will deﬁne nonnegative rank, discuss its properties and applications. We will explain a geometric characterization of nonnegative rank using nested polytopes. Finally, we will explore uniqueness of nonnegative factorizations and how it relates to the boundaries of the set of matrices of given nonnegative rank.
Organizer(s) Imran Anwar, Marc Chardin
linked URL https://sites.google.com/view/smscimpa21/home?authuser=0