A non-convex algorithm framework based on DC programming and DCA for matrix completion.

Juan Geng Lai-Sheng Wang Yanfei Wang

Published in: Numer. Algorithms (2015)

Keyphrases

matrix completion
np hard
learning algorithm
worst case
dc programming
globally optimal
probabilistic model
dynamic programming
computational complexity
optimal solution
expectation maximization
theoretical guarantees
image processing
simulated annealing
loss function
convex functions
objective function