Iterative methods for matrix completion that use nuclearnorm regularization. There are two main approaches.The one approach uses iterative softthresholded svds to impute the missing values. The second approach uses alternating least squares. Both have an 'EM' flavor, in that at each iteration the matrix is completed with the current estimate. For large matrices there is a special sparsematrix class named "Incomplete" that efficiently handles all computations. The package includes procedures for centering and scaling rows, columns or both, and for computing lowrank SVDs on large sparse centered matrices (i.e. principal components).
Package details 


Author  Trevor Hastie <hastie@stanford.edu> and Rahul Mazumder <rahul.mazumder@gmail.com> 
Maintainer  Trevor Hastie <hastie@stanford.edu> 
License  GPL2 
Version  1.41 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.