Optspace

swMATH12630MaRDI QIDQ24556FDOQ24556

Author name not available (Why is that?)

Described by source

• Matrix completion from noisy entries

Cited In (7)

• Normalized iterative hard thresholding for matrix completion
• Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
• 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
• Low-Rank Optimization with Trace Norm Penalty
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion

This page was built for software: Optspace