Login / Signup
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).
Erich Kaltofen
Bin Li
Kartik Sivaramakrishnan
Zhengfeng Yang
Lihong Zhi
Published in:
SNC (2007)
Keyphrases
</>
extended abstract
semidefinite programming
lower bound
linear programming
upper bound
interior point methods
semidefinite
objective function
kernel matrix
maximum margin
np hard
worst case
primal dual
optimal solution
linear combination
low rank