Factoring nonnegative matrices with linear programs

Problem 73-14, rank factorization of nonnegative matrices

L. B. Thomas · 1974

Earlier work this paper cites.

Join processing in database systems with large main memories

L. D. Shapiro · 1986

Earlier work this paper cites.

Efficient algorithms for computing a strong rank-revealing QR factorization

M. Gu and S. C. Eisenstat · 1996

Earlier work this paper cites.

Parallel and Distributed Computation: Numerical Methods

D. P. Bertsekas and J. N. Tsitsiklis · 1997

Earlier work this paper cites.

Probabilistic latent semantic indexing

T. Hofmann · 1999

Earlier work this paper cites.

Learning the parts of objects by non-negative matrix factorization

D. D. Lee and H. S. Seung · 1999

Earlier work this paper cites.

Algorithms for non-negative matrix factorization

D. D. Lee and H. S. Seung · 2001

Earlier work this paper cites.

Benchmarking optimization software with performance profiles

E. D. Dolan and J. J. Moré · 2002

Earlier work this paper cites.

When does non-negative matrix factorization give a correct decomposition into parts?

D. Donoho and V. Stodden · 2003

Cited alongside, same era.

Non-negative matrix factorization for polyphonic music transcription

P. Smaragdis · 2003

Cited alongside, same era.

RCV1: A new benchmark collection for text categorization research

D. Lewis, Y. Yang, T. Rose, and F. Li · 2004

Cited alongside, same era.

Sparse subspace clustering

E. Elhamifar and R. Vidal · 2009

Cited alongside, same era.

CUR matrix decompositions for improved data analysis

M. W. Mahoney and P. Drineas · 2009

Cited alongside, same era.

On the complexity of nonnegative matrix factorization

S. A. Vavasis · 2009

Cited alongside, same era.

CVX: Matlab software for disciplined convex programming, version 1.21

M. Grant and S. Boyd · 2010

Later among the works it cites.

Computing a nonnegative matrix factorization – provably

Original

S. Arora, R. Ge, R. Kannan, and A. Moitra · 2011

Later among the works it cites.

HOGWILD!: A lock-free approach to parallelizing stochastic gradient descent

F. Niu, B. Recht, C. Ré, and S. J. Wright · 2011

Later among the works it cites.

A geometric analysis of subspace clustering with outliers

Original

M. Soltanolkotabi and E. J. Candès · 2011

Later among the works it cites.

See all by looking at a few: Sparse modeling for finding representative objects

E. Elhamifar, G. Sapiro, and R. Vidal · 2012

Closest in time.