Login / Signup

Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion.

Richard Y. ZhangJavad Lavaei
Published in: Math. Program. (2021)
Keyphrases
  • semidefinite
  • worst case
  • semidefinite programming
  • clique tree
  • special case
  • sufficient conditions
  • probabilistic inference
  • computational complexity
  • least squares
  • machine learning