Optspace

swMATH12630MaRDI QIDQ24556FDOQ24556

Author name not available (Why is that?)

Official website: http://arxiv.org/pdf/0910.5260v2.pdf

Described by source

• Matrix completion from noisy entries

Cited In (10)

• 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
• Convergence of projected Landweber iteration for matrix rank minimization
• An efficient matrix factorization based low-rank representation for subspace clustering
• LMaFit
• Eigentaste
• ADMiRA
• Orthogonal rank-one matrix pursuit for low rank matrix completion
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion

This page was built for software: Optspace