A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization.

Nadav Hallak Marc Teboulle

Published in: Oper. Res. Lett. (2019)

Keyphrases

objective function
cost function
similarity measure
detection method
preprocessing
pairwise
significant improvement
high accuracy
support vector machine
missing data
computational cost
clustering method
matrix representation