Cited in
(10)- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Convergence of projected Landweber iteration for matrix rank minimization
- LMaFit
- Eigentaste
- ADMiRA
- Normalized iterative hard thresholding for matrix completion
- Low-rank optimization with trace norm penalty
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- An efficient matrix factorization based low-rank representation for subspace clustering
This page was built for software: Optspace
