Friday, 10:30 - 10:55 h, Room: H 0110


Nicolas Gillis
Fast and robust recursive algorithm for separable nonnegative matrix factorization

Coauthor: Stephen A. Vavasis


In this paper, we present an extremely fast recursive algorithm for nonnegative matrix factorization under the assumption that the nonnegative data matrix is separable (i.e., there exists a cone spanned by a small subset of the columns containing all columns). We prove that our technique is robust under any small perturbations of the data matrix, and experimentally show that it outperforms, both in terms of accuracy and speed, the state-of-the-art vertex component analysis algorithm of Nascimento and Bioucas-Dias.


Talk 1 of the invited session Fri.1.H 0110
"Recent advances in nonconvex quadratic programming with random data" [...]
Cluster 9
"Global optimization" [...]


  Online lending company provides a wide range of ways to get money by means of Tennessee Payday Loans. But at the same time, it acts only with sexual arousal. Viagra has a number of advantages in comparison with injections in the sexual organ or other procedures aimed at treatment of impotency.