Login / Signup

Sparse Semidefinite Programs with Near-Linear Time Complexity.

Richard Y. ZhangJavad Lavaei
Published in: CDC (2018)
Keyphrases
  • semidefinite
  • semidefinite programming
  • worst case
  • computational complexity
  • high dimensional
  • convex relaxation
  • model selection
  • linear program
  • higher dimensional
  • finite dimensional
  • interior point methods