Scalable low-rank representation
From MaRDI portal
Recommendations
- Active subspace: toward scalable low-rank learning
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- An efficient matrix factorization based low-rank representation for subspace clustering
- Robust principal component analysis: a factorization-based approach with linear complexity
- Relations among some low-rank subspace recovery models
Cites work
- A Singular Value Thresholding Algorithm for Matrix Completion
- Active subspace: toward scalable low-rank learning
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Consistency of trace norm minimization
- Exact matrix completion via convex optimization
- Fast singular value thresholding without singular value decomposition
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Local minima and convergence in low-rank semidefinite programming
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust principal component analysis?
- The Geometry of Algorithms with Orthogonality Constraints
- TILT: transform invariant low-rank textures
Cited in
(2)
This page was built for publication: Scalable low-rank representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449316)