Login / Signup

How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF.

Charly AlizadehPegah AlizadehMiguel F. AnjosLucas LétocartEmiliano Traversi
Published in: IJCNN (2022)
Keyphrases
  • semidefinite
  • semidefinite programming
  • convex relaxation
  • sufficient conditions
  • higher dimensional
  • interior point methods
  • convex sets
  • globally optimal
  • convex optimization
  • lower bound
  • quadratic programming