A convex relaxation to compute the nearest structured rank deficient matrix.

Diego Cifuentes

Published in: CoRR (2019)

Keyphrases

convex relaxation
semidefinite
convex optimization
matrix completion
globally optimal
multi label
multistage
singular values
low rank
multiple kernel learning
nearest neighbor
singular value decomposition
text classification
linear combination
graph cuts
semidefinite programming
information extraction