Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improving Clique Decompositions of Semidefinite Relaxations for Optimal
  Power Flow Problems   Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power
Flow problems. However, solving large-scale SDP problems requires exploiting
sparsity. In this paper, we experiment several clique decomposition algorithms
that lead to different reformulations and we show that the resolution is highly
sensitive to the clique decomposition procedure. Our main contribution is to
demonstrate that minimizing the number of additional edges in the chordal
extension is not always appropriate to get a good clique decomposition.

26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc