Fetching the paper…
Reading the bibliography…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific structures regarding the factors, such as positivity or sparsity.
The power method for ℓ p \ell_{p} -norms
D. W. Boyd · 1974
Earlier work this paper cites.
Summing and nuclear norms in Banach space theory
G. J. O. Jameson · 1987
Earlier work this paper cites.
Matrix Perturbation Theory
G. W. Stewart and J.-G. Sun · 1990
Earlier work this paper cites.
Matching pursuits with time-frequency dictionaries
S. G. Mallat and Z. Zhang · 1993
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Matrix computations
G. H. Golub and C. F. Van Loan · 1996
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1997
Earlier work this paper cites.
Semidefinite relaxation and nonconvex quadratic optimization
Y. Nesterov · 1998
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen, D. L. Donoho, and M. A. Saunders · 1999
Earlier work this paper cites.
Fast and robust fixed-point algorithms for independent component analysis
A. Hyvarinen · 1999
Earlier work this paper cites.
Learning the parts of objects by non-negative matrix factorization
D. D. Lee and S. H. Seung · 1999
Earlier work this paper cites.
Local operator theory, random matrices and Banach spaces
K. R. Davidson and S. J. Szarek · 2001
Earlier work this paper cites.
Completely positive matrices
A. Berman and N. Shaked-Monderer · 2003
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. D. C. Monteiro · 2003
Earlier work this paper cites.
The mathematics of eigenvalue optimization
A. S. Lewis · 2003
Earlier work this paper cites.
Submodular Functions and Optimization
S. Fujishige · 2005
Earlier work this paper cites.
Rank, trace-norm and max-norm
N. Srebro and A. Shraibman · 2005
Earlier work this paper cites.
The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representations
M. Aharon, M. Elad, and A. M. Bruckstein · 2006
Earlier work this paper cites.
Approximating the cut-norm via Grothendieck’s inequality
N. Alon and A. Naor · 2006
Cited alongside, same era.
Convex Analysis and Nonlinear Optimization: Theory and Examples
J. M. Borwein and A. S. Lewis · 2006
Cited alongside, same era.
Complexity measures of sign matrices
N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman · 2007
Cited alongside, same era.
Convex sparse matrix factorizations
F. Bach, J. Mairal, and J. Ponce · 2008
Cited alongside, same era.
Approximation and learning by greedy algorithms
A. R. Barron, A. Cohen, W. Dahmen, and R. A. DeVore · 2008
Cited alongside, same era.
Robust optimization
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski · 2009
Cited alongside, same era.
On approximating matrix norms
A. Ben-Tal and A. Nemirovski · 2011
Later among the works it cites.
A unifying polyhedral approximation framework for convex optimization
D. P. Bertsekas and H. Yu · 2011
Later among the works it cites.
Computing a nonnegative matrix factorization–provably
S. Arora, S. Ge, R. Kannan, and A. Moitra · 2012
Later among the works it cites.
The convex geometry of linear inverse problems
V. Chandrasekaran, B. Recht, P. A., and A. S. Willsky · 2012
Later among the works it cites.
Pattern classification
R. O. Duda, P. E. Hart, and D. G. Stork · 2012
Later among the works it cites.
Machine learning: a probabilistic perspective
K. P. Murphy · 2012
Later among the works it cites.
Convex relaxation of combinatorial penalties
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Févotte, N. Bertin, and J.-L. Durrieu · 2009
Cited alongside, same era.
Joint covariate selection and joint subspace selection for multiple classification problems
G. Obozinski, B. Taskar, and M. I. Jordan · 2009
Cited alongside, same era.
Iteratively reweighted least squares minimization for sparse recovery
I. Daubechies, R. DeVore, M. Fornasier, and C. S. Güntürk · 2010
Cited alongside, same era.
Low-rank optimization on the cone of positive semidefinite matrices
M. Journée, F. Bach, P.-A. Absil, and R. Sepulchre · 2010
Cited alongside, same era.
Generalized power method for sparse principal component analysis
M. Journée, Y. Nesterov, P. Richtárik, and R. Sepulchre · 2010
Cited alongside, same era.
Practical large-scale optimization for max-norm regularization
J. Lee, B. Recht, N. Srebro, J. Tropp, and R. Salakhutdinov · 2010
Cited alongside, same era.
G. Obozinski and F. Bach · 2012
Later among the works it cites.
Factoring nonnegative matrices with linear programs
B. Recht, C. Re, J. Tropp, and V. Bittorf · 2012
Later among the works it cites.
Robust PCA via outlier pursuit
H. Xu, C. Caramanis, and S. Sanghavi · 2012
Later among the works it cites.
Accelerated training for matrix-norm regularization: A boosting approach
X. Zhang, D. Schuurmans, and Y. Yu · 2012
Later among the works it cites.
Duality between subgradient and conditional gradient methods
F. Bach · 2013
Closest in time.
Concentration Inequalities: A Nonasymptotic Theory of Independence
S. Boucheron, G. Lugosi, and P. Massart · 2013
Closest in time.
Finding hidden cliques of size N / e \sqrt{N/e} in nearly linear time
Y. Deshpande and A. Montanari · 2013
Closest in time.
Conditional gradient algorithms for norm-regularized smooth convex optimization
Z. Harchaoui, A. Juditsky, and A. Nemirovski · 2013
Closest in time.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
M. Jaggi · 2013
Closest in time.
Do semidefinite relaxations really solve sparse PCA?
R. Krauthgamer, B. Nadler, and D. Vilenchik · 2013
Closest in time.
Regularizers for structured sparsity
C. A. Micchelli, J. M. Morales, and M. Pontil · 2013
Closest in time.