Login / Signup
A nonconvex approach to low-rank matrix completion using convex optimization.
Damiana Lazzaro
Published in:
Numer. Linear Algebra Appl. (2016)
Keyphrases
</>
convex optimization
low rank
matrix completion
low rank matrices
low rank matrix
rank minimization
kernel matrix
convex relaxation
norm minimization
total variation
norm regularization
interior point methods
primal dual
trace norm
nuclear norm
singular values
minimization problems
data matrix
low rank approximation