A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization.

Yang Yang Marius Pesavento

Published in: ICASSP (2018)

Keyphrases

objective function
dynamic programming
np hard
convergence rate
global convergence
k means
cost function
simulated annealing
rank minimization
learning algorithm
similarity measure
optimal solution
high dimensional
quadratic programming
line search