SDP and eigenvalue bounds for the graph partition problem
|
|
- Ethan Arnold Chandler
- 5 years ago
- Views:
Transcription
1 SDP and eigenvalue bounds for the graph partition problem Renata Sotirov and Edwin van Dam Tilburg University, The Netherlands
2 Outline... the graph partition problem
3 Outline... the graph partition problem matrix lifting vector lifting
4 Outline... the graph partition problem matrix lifting vector lifting simplify complicate
5 Outline... the graph partition problem matrix lifting vector lifting simplify complicate???
6 The Graph Partition Problem G = (V, E)... an undirected graph V... vertex set, V = n E... edge set
7 The Graph Partition Problem G = (V, E)... an undirected graph V... vertex set, V = n E... edge set The k-partition problem (GPP) Find a partition of V into k subsets S 1,..., S k of given sizes m 1... m k, s.t. the total weight of edges joining different S i is minimized.
8 The Graph Partition Problem G = (V, E)... an undirected graph V... vertex set, V = n E... edge set The k-partition problem (GPP) Find a partition of V into k subsets S 1,..., S k of given sizes m 1... m k, s.t. the total weight of edges joining different S i is minimized. m i = V k, i the graph equipartition problem k = 2 the bisection problem
9 The k-partition problem A... the adjacency matrix of G, m := (m 1,..., m k ) T
10 The k-partition problem A... the adjacency matrix of G, m := (m 1,..., m k ) T V k let X = (x ij ) R { 1, if vertex i Sj x ij := 0, if vertex i / S j
11 The k-partition problem A... the adjacency matrix of G, m := (m 1,..., m k ) T V k let X = (x ij ) R { 1, if vertex i Sj x ij := 0, if vertex i / S j P k := { X R n k : Xu k = u n, X T u n = m, x ij {0, 1} }, where u n... vector of all ones
12 The k-partition problem A... the adjacency matrix of G, m := (m 1,..., m k ) T V k let X = (x ij ) R { 1, if vertex i Sj x ij := 0, if vertex i / S j P k := { X R n k : Xu k = u n, X T u n = m, x ij {0, 1} }, where u n... vector of all ones For X P k : w(e cut ) = 1 2 tr(x T LX ) = 1 2 tr A(J n XX T ) where L := Diag(Au n ) A is the Laplacian matrix of G
13 The Graph Partition Problem The trace formulation: (GPP) 1 min 2 trace(x T LX ) s.t. Xu k = u n X T u n = m x ij {0, 1}
14 The Graph Partition Problem The trace formulation: (GPP) 1 min 2 trace(x T LX ) s.t. Xu k = u n X T u n = m x ij {0, 1} the GPP... is NP-hard (Garey and Johnson, 1976)
15 The Graph Partition Problem The trace formulation: (GPP) 1 min 2 trace(x T LX ) s.t. Xu k = u n X T u n = m x ij {0, 1} the GPP... is NP-hard (Garey and Johnson, 1976) applications: VLSI design, parallel computing, floor planning, telecommunications, etc.
16 . matrix lifting SDP for the GPP...
17 SDP for GPP linearize the objective: trace(lxx T ) trace(ly)
18 SDP for GPP linearize the objective: trace(lxx T ) trace(ly) Y conv{ỹ : X P k s.t. Ỹ = XX T } ky J n 0.
19 SDP for GPP linearize the objective: trace(lxx T ) trace(ly) Y conv{ỹ : X P k s.t. Ỹ = XX T } ky J n 0. S., 2013 (GPP m ) min 1 2 tr(ly ) s.t. diag(y ) = u n tr(jy ) = k mi 2 i=1 ky J n 0, Y 0
20 SDP for GPP linearize the objective: trace(lxx T ) trace(ly) Y conv{ỹ : X P k s.t. Ỹ = XX T } ky J n 0. S., 2013 (GPP m ) min 1 2 tr(ly ) s.t. diag(y ) = u n tr(jy ) = k mi 2 i=1 ky J n 0, Y 0 for k = 2 the nonnegativity constraints are redundant
21 GPP m and known relaxations GPP m... for equipartition is equivalent to the relaxation from: S.E. Karisch, F. Rendl. Semidefnite programming and graph equipartition. In: Topics in Semidefinite and Interior Point Methods, The Fields Institute for research in Math. Sc., Comm. Ser. Rhode Island, 18, 1998.
22 GPP m and known relaxations GPP m... for equipartition is equivalent to the relaxation from: S.E. Karisch, F. Rendl. Semidefnite programming and graph equipartition. In: Topics in Semidefinite and Interior Point Methods, The Fields Institute for research in Math. Sc., Comm. Ser. Rhode Island, 18, for bisection is equivalent to the relaxation from: S. E. Karisch, F. Rendl, J. Clausen. Solving graph bisection problems with semidefinite programming, INFORMS J. Comput., 12: , 2000.
23 Strengthening?
24 Strengthening?? How to strengthen GPP m?
25 Strengthening?? How to strengthen GPP m? impose the linear inequalities: constraints y ab + y ac 1 + y bc, (a, b, c) independent set constraints y ab 1, W s.t. W = k + 1 a<b, a,b W
26 Strengthening?? How to strengthen GPP m? impose the linear inequalities: constraints y ab + y ac 1 + y bc, (a, b, c) independent set constraints y ab 1, W s.t. W = k + 1 a<b, a,b W there are 3 ( ) ( n 3, and n k+1) independent set constraints
27 On computational issues... in general, for graphs with 100 vertices and k = 3: the best known vector lifting relaxation is hopeless
28 On computational issues... in general, for graphs with 100 vertices and k = 3: the best known vector lifting relaxation is hopeless GPP m + triangle inequalities + independent set solves 3 h
29 On computational issues... in general, for graphs with 100 vertices and k = 3: the best known vector lifting relaxation is hopeless GPP m + triangle inequalities + independent set solves 3 h GPP m solves 14 min
30 On computational issues... in general, for graphs with 100 vertices and k = 3: the best known vector lifting relaxation is hopeless GPP m + triangle inequalities + independent set solves 3 h GPP m solves 14 min Can we compute GPP m with/without additional constr. more efficiently?
31 On computational issues... in general, for graphs with 100 vertices and k = 3: the best known vector lifting relaxation is hopeless GPP m + triangle inequalities + independent set solves 3 h GPP m solves 14 min Can we compute GPP m with/without additional constr. more efficiently? yes
32 Simplification highly symmetric graphs...
33 Simplification highly symmetric graphs... matrix *-algebra: subspace of R n n that is closed under matrix multiplication and taking transposes
34 Simplification highly symmetric graphs... matrix *-algebra: subspace of R n n that is closed under matrix multiplication and taking transposes Assumption: The data matrices of an SDP problem and I belong to a matrix *-algebra span{a 1,..., A r } where r n 2
35 Simplification highly symmetric graphs... matrix *-algebra: subspace of R n n that is closed under matrix multiplication and taking transposes Assumption: The data matrices of an SDP problem and I belong to a matrix *-algebra span{a 1,..., A r } where r n 2 Then, if the SDP relaxation has an optimal solution it has an optimal solution in the matrix *-algebra.
36 Simplification highly symmetric graphs... matrix *-algebra: subspace of R n n that is closed under matrix multiplication and taking transposes Assumption: The data matrices of an SDP problem and I belong to a matrix *-algebra span{a 1,..., A r } where r n 2 Then, if the SDP relaxation has an optimal solution it has an optimal solution in the matrix *-algebra. Schrijver, Goemans, Rendl, Parrilo,...
37 Simplification highly symmetric graphs... matrix *-algebra: subspace of R n n that is closed under matrix multiplication and taking transposes Assumption: The data matrices of an SDP problem and I belong to a matrix *-algebra span{a 1,..., A r } where r n 2 Then, if the SDP relaxation has an optimal solution it has an optimal solution in the matrix *-algebra. Schrijver, Goemans, Rendl, Parrilo,... a basis of the matrix *-algebra (coming from combinatorial or group symmetry): (i) A i {0, 1} n n, A T i {A 1,..., A r }, (i = 1,..., r) (ii) r i=1 A i = J, i I A i = I, I {1,..., r} (iii) For i, j {1,..., r}, p h ij such that A i A j = r h=1 ph ija h.
38 Simplification highly symmetric graphs... Y = r z i A i, z i R (r n 2 ) i=1 (GPP m ) 1 min 2 tr(aj r n) 1 2 z i tr(aa i ) i=1 s.t. z i diag(a i ) = u n i I r z i tr(ja i ) = k i=1 mi 2 i=1 k r z i A i J n 0, z i 0, i = 1,..., r. j=1
39 Simplification highly symmetric graphs... Y = r z i A i, z i R (r n 2 ) i=1 (GPP m ) 1 min 2 tr(aj r n) 1 2 z i tr(aa i ) i=1 s.t. z i diag(a i ) = u n i I r z i tr(ja i ) = k i=1 mi 2 i=1 k r z i A i J n 0, z i 0, i = 1,..., r. j=1 LMI may be (block-)diagonalized
40 Simplification highly symmetric graphs... Y = r z i A i, z i R (r n 2 ) i=1 (GPP m ) 1 min 2 tr(aj r n) 1 2 z i tr(aa i ) i=1 s.t. z i diag(a i ) = u n i I r z i tr(ja i ) = k i=1 mi 2 i=1 k r z i A i J n 0, z i 0, i = 1,..., r. j=1 LMI may be (block-)diagonalized exploit properties of A i to aggregate and indep. set const. extend the approach from: M.X. Goemans, F. Rendl. Semidefinite Programs and Association Schemes. Computing, 63(4): , 1999.
41 On aggregating constraints... for a given (a, b, c) consider the inequality y ab + y ac 1 + y bc
42 On aggregating constraints... for a given (a, b, c) consider the inequality y ab + y ac 1 + y bc if (A i ) ab = 1, (A h ) ac = 1, (A j ) bc = 1 type (i, j, h) ineq.,
43 On aggregating constraints... for a given (a, b, c) consider the inequality y ab + y ac 1 + y bc if (A i ) ab = 1, (A h ) ac = 1, (A j ) bc = 1 type (i, j, h) ineq., by summing all ineq. of type (i, j, h), the aggregated ineq.: p i hj tr A iy + p h ij tr A h Y p i hj tr A ij + p j i h tr A jy, where p h ij : A ia j = r h=1 ph ij A h j : is the index s.t. A j = A T j
44 On aggregating constraints... for a given (a, b, c) consider the inequality y ab + y ac 1 + y bc if (A i ) ab = 1, (A h ) ac = 1, (A j ) bc = 1 type (i, j, h) ineq., by summing all ineq. of type (i, j, h), the aggregated ineq.: p i hj tr A iy + p h ij tr A h Y p i hj tr A ij + p j i h tr A jy, where p h ij : A ia j = r h=1 ph ij A h j : is the index s.t. A j = A T j use: Y = r j=1 z ja j
45 On aggregating constraints... for a given (a, b, c) consider the inequality y ab + y ac 1 + y bc if (A i ) ab = 1, (A h ) ac = 1, (A j ) bc = 1 type (i, j, h) ineq., by summing all ineq. of type (i, j, h), the aggregated ineq.: p i hj tr A iy + p h ij tr A h Y p i hj tr A ij + p j i h tr A jy, where p h ij : A ia j = r h=1 ph ij A h j : is the index s.t. A j = A T j use: Y = r j=1 z ja j of aggregated constraints is bounded by r 3
46 On aggregating constraints... for a given (a, b, c) consider the inequality y ab + y ac 1 + y bc if (A i ) ab = 1, (A h ) ac = 1, (A j ) bc = 1 type (i, j, h) ineq., by summing all ineq. of type (i, j, h), the aggregated ineq.: p i hj tr A iy + p h ij tr A h Y p i hj tr A ij + p j i h tr A jy, where p h ij : A ia j = r h=1 ph ij A h j : is the index s.t. A j = A T j use: Y = r j=1 z ja j of aggregated constraints is bounded by r 3 similar approach applies to independent set constr. when k = 2
47 Simplification highly symmetric graphs... Example. Strongly regular graph (SRG)
48 Simplification highly symmetric graphs... Example. Strongly regular graph (SRG) n vertices, κ the valency of the graph
49 Simplification highly symmetric graphs... Example. Strongly regular graph (SRG) n vertices, κ the valency of the graph A has exactly two eigenvalues r 0 and s < 0 associated with eigenvectors u n
50 Simplification highly symmetric graphs... Example. Strongly regular graph (SRG) n vertices, κ the valency of the graph A has exactly two eigenvalues r 0 and s < 0 associated with eigenvectors u n A belongs to the *-algebra spanned by {I, A, J A I }
51 Simplification highly symmetric graphs... Example. Strongly regular graph (SRG) n vertices, κ the valency of the graph A has exactly two eigenvalues r 0 and s < 0 associated with eigenvectors u n A belongs to the *-algebra spanned by {I, A, J A I } Y = I + z 1 A + z 2 (J A I )
52 Simplification highly symmetric graphs... Example. Strongly regular graph (SRG) n vertices, κ the valency of the graph A has exactly two eigenvalues r 0 and s < 0 associated with eigenvectors u n A belongs to the *-algebra spanned by {I, A, J A I } Y = I + z 1 A + z 2 (J A I ) (GPP m ) min 1 2 κn(1 z 1) s.t. κz 1 + (n κ 1)z 2 = 1 n 1 + rz 1 (r + 1)z sz 1 (s + 1)z 2 0 z 1, z 2 0 k mi 2 1 i=1
53 SRG Theorem. Let G = (V, E) be a SRG with eigenvalues κ, r, s. Let m i N, i = 1,..., k s.t. k j=1 m j = n. Then the SDP bound for the minimum k-partition is { κ r max n i<j m ( ) } 1 im j, 2 n(κ + 1) i m2 i Similarly, the SDP bound for the maximum k-partition is { } κ s min n i<j m 1 im j, 2 κn.
54 SRG Theorem. Let G = (V, E) be a SRG with eigenvalues κ, r, s. Let m i N, i = 1,..., k s.t. k j=1 m j = n. Then the SDP bound for the minimum k-partition is { κ r max n i<j m ( ) } 1 im j, 2 n(κ + 1) i m2 i Similarly, the SDP bound for the maximum k-partition is { } κ s min n i<j m 1 im j, 2 κn. this is an extension of the result for the equipartition: De Klerk, Pasechnik, S., Dobre: On SDP relaxations of maximum k-section, Math. Program. Ser. B, 136(2): , 2012.
55 SRG after aggregating, 3 ( n 3) constraints remain: z 1 1 z 2 1 2z 1 z 2 1 z 1 + 2z 2 1
56 SRG after aggregating, 3 ( n 3) constraints remain: z 1 1 z 2 1 2z 1 z 2 1 z 1 + 2z 2 1 Prop. For SRG with n > 5 the ineq. are redundant in GPP m.
57 SRG after aggregating, 3 ( n 3) constraints remain: z 1 1 z 2 1 2z 1 z 2 1 z 1 + 2z 2 1 Prop. For SRG with n > 5 the ineq. are redundant in GPP m. However, the independent set constraints improve GPP m.
58 Simplification not a special graph...
59 Simplification not a special graph... closed form expression for the GPP for any graph
60 Simplification not a special graph... closed form expression for the GPP for any graph L = Diag(Au n ) A... the Laplacian matrix of G
61 Simplification not a special graph... closed form expression for the GPP for any graph L = Diag(Au n ) A... the Laplacian matrix of G L := span{f 0,..., F d } the Laplacian algebra corr. to L
62 Simplification not a special graph... closed form expression for the GPP for any graph L = Diag(Au n ) A... the Laplacian matrix of G L := span{f 0,..., F d } the Laplacian algebra corr. to L F i = U i Ui T, i... where U i corr. to the distinct eig. λ i d i=0 F i = I F i F j = δ ij F i for i j tr(f i ) = f i... the multiplicity of i-th eigenvalue of L
63 Simplification not a special graph... in GPP m : relax diag(y ) = u n tr(y ) = n remove nonnegativity constraints
64 Simplification not a special graph... in GPP m : relax diag(y ) = u n tr(y ) = n remove nonnegativity constraints (GPP eig ) 1 min 2 tr LY s.t. tr(y ) = n tr(jy ) = k mi 2 i=1 ky J n 0
65 Simplification not a special graph... in GPP m : relax diag(y ) = u n tr(y ) = n remove nonnegativity constraints (GPP eig ) 1 min 2 tr LY s.t. tr(y ) = n tr(jy ) = k ky J n 0 mi 2 i=1 Y = d z i F i, z i R (i = 0,..., d) i=0
66 Simplification not a special graph... in GPP m : relax diag(y ) = u n tr(y ) = n remove nonnegativity constraints (GPP eig ) 1 min 2 tr LY s.t. tr(y ) = n tr(jy ) = k ky J n 0 mi 2 i=1 Y = d z i F i, z i R (i = 0,..., d) i=0 tr(ly ) = tr( d λ j F j ( d z i F i )) = d λ i f i z i j=0 i=0 i=0 where 0 = λ 0... λ d distinct eigenvalues of L etc....
67 Simplification not a special graph... Theorem Let G = (V, E) be a graph, m T = (m 1,..., m k ) s.t. k j=1 m j = n. Then the GPP eig bound for the minimum k-partition of G equals m i m j, λ 1 n i<j and the bound GPP eig for the maximum k-partition of G equals m i m j. λ d n i<j
68 Simplification not a special graph... Theorem Let G = (V, E) be a graph, m T = (m 1,..., m k ) s.t. k j=1 m j = n. Then the GPP eig bound for the minimum k-partition of G equals m i m j, λ 1 n i<j and the bound GPP eig for the maximum k-partition of G equals m i m j. λ d n i<j for the bisection the above results coincide with: M. Juvan, B. Mohar: Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math., 36: , for the min 3-partition: J. Falkner, F. Rendl, H. Wolkowicz. A computational study of graph partitioning. Math. Program., 66: , 1994.
69 . computational results...
70 Quality of the presented bounds G n partition GPP eig GPP m Doob design grid graph 100 (50,25,25) 4 6 Higman-Sims Table : Lower bounds for the min graph partition.
71 Quality of the presented bounds G n partition GPP eig GPP m Doob design grid graph 100 (50,25,25) 4 6 Higman-Sims Table : Lower bounds for the min graph partition. G n m GPP m GPP m GPP m ind J(7, 2) 21 (11,10) Foster 90 (45,45) Biggs-Smith 102 (70,32) Table : Lower bounds for the min bisection. each bound computed in a few seconds
72 . vector lifting for the GPP...
73 Vector lifting for GPP let m = (m 1,..., m k ) T, i m i = n
74 Vector lifting for GPP let m = (m 1,..., m k ) T, i m i = n X P k := { X R n k : Xu k = u n, X T u n = m, x ij {0, 1} }
75 Vector lifting for GPP let m = (m 1,..., m k ) T, i m i = n X P k := { X R n k : Xu k = u n, X T u n = m, x ij {0, 1} } define y := vec(x ), Y := yy T relax Y yy T 0
76 Vector lifting for GPP let m = (m 1,..., m k ) T, i m i = n X P k := { X R n k : Xu k = u n, X T u n = m, x ij {0, 1} } define y := vec(x ), Y := yy T relax Y yy T 0 (GPP v ) min 1 2 tr((j k I k ) A)Y s.t. tr((j k I k ) I n )Y = 0 tr(i k J n )Y + tr(y ) = ( k mi 2 + n) ( 1 y T y Y i=1 ) + 2y T ((m + u k ) u n ) S + nk+1, Y 0 H. Wolkowicz and Q. Zhao. Semidefinite programming relaxations for the graph partitioning problem. Discrete Appl. Math., 96 97: , original Zhao-Wolkowicz relaxation does not include Y 0
77 Vector lifting for GPP Theorem (S., 2012) When restricted to the equipartition, GPP v and GPP m are equivalent.
78 Vector lifting for GPP Theorem (S., 2012) When restricted to the equipartition, GPP v and GPP m are equivalent. Theorem (S., 2013) When restricted to the bisection, GPP v dominates GPP m.
79 Vector lifting for GPP Theorem (S., 2012) When restricted to the equipartition, GPP v and GPP m are equivalent. Theorem (S., 2013) When restricted to the bisection, GPP v dominates GPP m. numerical experiments show: gap between GPP v and GPP m reduces for k > 5
80 . How to strengthen GPP v?
81 . How to strengthen GPP v? We demonstrate for the bisection problem.
82 New bound for the bisection assign a pair of vertices of G to different parts of the partition
83 New bound for the bisection assign a pair of vertices of G to different parts of the partition Which pair of vertices?
84 New bound for the bisection assign a pair of vertices of G to different parts of the partition Which pair of vertices? consider the action of aut(a) on the pair of vertices (i, j) i.e., orbital: {(Pe i, Pe j ) : P aut(a)}
85 New bound for the bisection assign a pair of vertices of G to different parts of the partition Which pair of vertices? consider the action of aut(a) on the pair of vertices (i, j) i.e., orbital: {(Pe i, Pe j ) : P aut(a)} orbitals represent the different kinds of pairs of vertices
86 New bound for the bisection assign a pair of vertices of G to different parts of the partition Which pair of vertices? consider the action of aut(a) on the pair of vertices (i, j) i.e., orbital: {(Pe i, Pe j ) : P aut(a)} orbitals represent the different kinds of pairs of vertices assume that there are t such orbitals: O h (h = 1, 2,..., t) we prove the following
87 New bound for the bisection Theorem. Let G be an undirected graph with adjacency matrix A, and t orbitals O h (h = 1, 2,..., t) of edges and nonedges.
88 New bound for the bisection Theorem. Let G be an undirected graph with adjacency matrix A, and t orbitals O h (h = 1, 2,..., t) of edges and nonedges. Let (r h1, r h2 ) be an arbitrary pair of vertices in O h (h = 1, 2,..., t).
89 New bound for the bisection Theorem. Let G be an undirected graph with adjacency matrix A, and t orbitals O h (h = 1, 2,..., t) of edges and nonedges. Let (r h1, r h2 ) be an arbitrary pair of vertices in O h (h = 1, 2,..., t). Then min tr Z T AZ(J 2 I 2 ) = Z P 2 min h=1,2,...,t min tr X T AX (J 2 I 2 ), X P 2(h) where P 2 (h) = {X P 2 : X rh1,1 = 1, X rh2,2 = 1} (h = 1, 2,..., t).
90 New bound for the bisection Theorem. Let G be an undirected graph with adjacency matrix A, and t orbitals O h (h = 1, 2,..., t) of edges and nonedges. Let (r h1, r h2 ) be an arbitrary pair of vertices in O h (h = 1, 2,..., t). Then min tr Z T AZ(J 2 I 2 ) = Z P 2 min h=1,2,...,t min tr X T AX (J 2 I 2 ), X P 2(h) where P 2 (h) = {X P 2 : X rh1,1 = 1, X rh2,2 = 1} (h = 1, 2,..., t). for each h, compute: µ h := {GPP v with two additional constraints}
91 New bound for the bisection Theorem. Let G be an undirected graph with adjacency matrix A, and t orbitals O h (h = 1, 2,..., t) of edges and nonedges. Let (r h1, r h2 ) be an arbitrary pair of vertices in O h (h = 1, 2,..., t). Then min tr Z T AZ(J 2 I 2 ) = Z P 2 min h=1,2,...,t min tr X T AX (J 2 I 2 ), X P 2(h) where P 2 (h) = {X P 2 : X rh1,1 = 1, X rh2,2 = 1} (h = 1, 2,..., t). for each h, compute: µ h := {GPP v with two additional constraints} the new lower bound for the bisection problem is: GPP fix := min h=1,...,t µ h
92 . computational results...
93 Comparison of bounds... in general, it is difficult to solve GPP fix
94 Comparison of bounds... in general, it is difficult to solve GPP fix but for graphs with symmetry... G n m T GPP m GPP v GPP m ind GPP fix J(6, 2) 15 (8,7) Gewirtz 56 (53,3) M (74,3) Higman-Sims part Table : Lower bounds for the min GPP each bound computed with IPM in < 30s
95 Example: the bandwidth problem
96 Example: the bandwidth problem The Bandwidth Problem in graphs: label the vertices v i of G with distinct integers φ(v i ) s.t. max φ(v i) φ(v j ) minimal (v i,v j ) E
97 Example: the bandwidth problem The Bandwidth Problem in graphs: label the vertices v i of G with distinct integers φ(v i ) s.t. max φ(v i) φ(v j ) minimal (v i,v j ) E
98 Example: the bandwidth problem The Bandwidth Problem in graphs: label the vertices v i of G with distinct integers φ(v i ) s.t. max φ(v i) φ(v j ) minimal (v i,v j ) E
99 Example: the bandwidth problem The Bandwidth Problem in graphs: label the vertices v i of G with distinct integers φ(v i ) s.t. max φ(v i) φ(v j ) minimal (v i,v j ) E
100 The bandwidth problem the bandwidth problem is related to the following GPP problem
101 The bandwidth problem the bandwidth problem is related to the following GPP problem The min-cut problem is: OPT MC := min s.t. i S 1,j S 2 a ij (S 1, S 2, S 3 ) partitions V S i = m i, i = 1, 2, 3, where A = (a ij ) is the adjacency matrix of G.
102 The bandwidth problem the bandwidth problem is related to the following GPP problem The min-cut problem is: OPT MC := min s.t. i S 1,j S 2 a ij (S 1, S 2, S 3 ) partitions V S i = m i, i = 1, 2, 3, where A = (a ij ) is the adjacency matrix of G. bandwidth lower bound (Povh-Rendl (2007), van Dam-S.): If for some m = (m 1, m 2, m 3 ) it holds that OPT MC ν > 0, then σ (G) m ν + 1 4
103 The bandwidth problem - SDP relaxation SDP relaxations for the min-cut: solve GPP v and GPP fix with objective 1 trace(d A)Y 2 where D =
104 Bandwidth of Hamming graphs... Hamming graph H(d, q) is the graph Cartesian product of d copies of the complete graph K q.
105 Bandwidth of Hamming graphs... Hamming graph H(d, q) is the graph Cartesian product of d copies of the complete graph K q. q nodes old bw v time(s) bw fix time(s) u.b Table : Bounds on the bandwidth of H(3, q) bw v and bw fix obtained by use of: m α upper bounds obtained by improved rev. Cuthill-McKee algor.
106 More on bounds... we also compute the best known lower/upper bounds for: H(4, q) the 3-dimensional generalized Hamming graphs H q1,q2,q3 the Johnson and Kneser graphs
107 ThAnK YoU!
Applications of semidefinite programming, symmetry and algebra to graph partitioning problems
Applications of semidefinite programming, symmetry and algebra to graph partitioning problems Edwin van Dam and Renata Sotirov Tilburg University, The Netherlands Summer 2018 Edwin van Dam (Tilburg) SDP,
More informationSemidefinite programming and eigenvalue bounds for the graph partition problem
Semidefinite programming and eigenvalue bounds for the graph partition problem E.R. van Dam R. Sotirov Abstract The graph partition problem is the problem of partitioning the vertex set of a graph into
More informationOn bounding the bandwidth of graphs with symmetry
On bounding the bandwidth of graphs with symmetry E.R. van Dam R. Sotirov Abstract We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem.
More informationNew bounds for the max-k-cut and chromatic number of a graph
New bounds for the max-k-cut and chromatic number of a graph E.R. van Dam R. Sotirov Abstract We consider several semidefinite programming relaxations for the max-k-cut problem, with increasing complexity.
More informationRelaxations of combinatorial problems via association schemes
1 Relaxations of combinatorial problems via association schemes Etienne de Klerk, Fernando M. de Oliveira Filho, and Dmitrii V. Pasechnik Tilburg University, The Netherlands; Nanyang Technological University,
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationSDP relaxations for some combinatorial optimization problems
SDP relaxations for some combinatorial optimization problems Renata Sotirov Department of Econometrics and Operations Research, Tilburg University, Warandelaan 2, 5000 LE Tilburg, The Netherlands. r.sotirov@uvt.nl
More informationThe min-cut and vertex separator problem
manuscript No. (will be inserted by the editor) The min-cut and vertex separator problem Fanz Rendl Renata Sotirov the date of receipt and acceptance should be inserted later Abstract We consider graph
More informationModeling with semidefinite and copositive matrices
Modeling with semidefinite and copositive matrices Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Singapore workshop 2006 p.1/24 Overview Node and Edge relaxations
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationA Continuation Approach Using NCP Function for Solving Max-Cut Problem
A Continuation Approach Using NCP Function for Solving Max-Cut Problem Xu Fengmin Xu Chengxian Ren Jiuquan Abstract A continuous approach using NCP function for approximating the solution of the max-cut
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationApplications of semidefinite programming in Algebraic Combinatorics
Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011 We often want to 1 Bound the value of a numerical parameter of certain combinatorial
More informationMIT Algebraic techniques and semidefinite optimization February 14, Lecture 3
MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
More informationImproved bounds on crossing numbers of graphs via semidefinite programming
Improved bounds on crossing numbers of graphs via semidefinite programming Etienne de Klerk and Dima Pasechnik Tilburg University, The Netherlands Francqui chair awarded to Yurii Nesterov, Liege, February
More informationCopositive and Semidefinite Relaxations of the Quadratic Assignment Problem (appeared in Discrete Optimization 6 (2009) )
Copositive and Semidefinite Relaxations of the Quadratic Assignment Problem (appeared in Discrete Optimization 6 (2009) 231 241) Janez Povh Franz Rendl July 22, 2009 Abstract Semidefinite relaxations of
More informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationImproved bounds on book crossing numbers of complete bipartite graphs via semidefinite programming
Improved bounds on book crossing numbers of complete bipartite graphs via semidefinite programming Etienne de Klerk, Dima Pasechnik, and Gelasio Salazar NTU, Singapore, and Tilburg University, The Netherlands
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F. Jarre (Düsseldorf) and
More informationLift-and-Project Techniques and SDP Hierarchies
MFO seminar on Semidefinite Programming May 30, 2010 Typical combinatorial optimization problem: max c T x s.t. Ax b, x {0, 1} n P := {x R n Ax b} P I := conv(k {0, 1} n ) LP relaxation Integral polytope
More informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationLecture 13: Spectral Graph Theory
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 13: Spectral Graph Theory Lecturer: Shayan Oveis Gharan 11/14/18 Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More information1 T 1 = where 1 is the all-ones vector. For the upper bound, let v 1 be the eigenvector corresponding. u:(u,v) E v 1(u)
CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh (rezab@stanford.edu) Final Review Session 03/20/17 1. Let G = (V, E) be an unweighted, undirected graph. Let λ 1 be the maximum eigenvalue
More informationMax k-cut and the smallest eigenvalue
Max -cut and the smallest eigenvalue V. Niiforov arxiv:1604.0088v [math.co] 11 Apr 016 Abstract Let G be a graph of order n and size m, and let mc (G) be the maximum size of a -cut of G. It is shown that
More informationThe Simplest Semidefinite Programs are Trivial
The Simplest Semidefinite Programs are Trivial Robert J. Vanderbei Bing Yang Program in Statistics & Operations Research Princeton University Princeton, NJ 08544 January 10, 1994 Technical Report SOR-93-12
More informationCharacterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University
Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs Sung Y. Song Iowa State University sysong@iastate.edu Notation K: one of the fields R or C X: a nonempty finite set
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationA LINEAR PROGRAMMING APPROACH TO SEMIDEFINITE PROGRAMMING PROBLEMS
A LINEAR PROGRAMMING APPROACH TO SEMIDEFINITE PROGRAMMING PROBLEMS KARTIK KRISHNAN AND JOHN E. MITCHELL Abstract. Until recently, the study of interior point methods has doated algorithmic research in
More informationThe maximal stable set problem : Copositive programming and Semidefinite Relaxations
The maximal stable set problem : Copositive programming and Semidefinite Relaxations Kartik Krishnan Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY 12180 USA kartis@rpi.edu
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationLecture 9: Laplacian Eigenmaps
Lecture 9: Radu Balan Department of Mathematics, AMSC, CSCAMM and NWC University of Maryland, College Park, MD April 18, 2017 Optimization Criteria Assume G = (V, W ) is a undirected weighted graph with
More informationMustapha Ç. Pinar 1. Communicated by Jean Abadie
RAIRO Operations Research RAIRO Oper. Res. 37 (2003) 17-27 DOI: 10.1051/ro:2003012 A DERIVATION OF LOVÁSZ THETA VIA AUGMENTED LAGRANGE DUALITY Mustapha Ç. Pinar 1 Communicated by Jean Abadie Abstract.
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationAn Algorithmist s Toolkit September 10, Lecture 1
18.409 An Algorithmist s Toolkit September 10, 2009 Lecture 1 Lecturer: Jonathan Kelner Scribe: Jesse Geneson (2009) 1 Overview The class s goals, requirements, and policies were introduced, and topics
More informationCertifying the Global Optimality of Graph Cuts via Semidefinite Programming: A Theoretic Guarantee for Spectral Clustering
Certifying the Global Optimality of Graph Cuts via Semidefinite Programming: A Theoretic Guarantee for Spectral Clustering Shuyang Ling Courant Institute of Mathematical Sciences, NYU Aug 13, 2018 Joint
More informationEigenvalue Optimization for Solving the
Ecole Polytechnique Fédérale de Lausanne Master of Mathematical Sciences Semester project Prof. Daniel Kressner Supervisor: Petar Sirkovic Eigenvalue Optimization for Solving the MAX-CUT Problem Julien
More informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationFinding normalized and modularity cuts by spectral clustering. Ljubjana 2010, October
Finding normalized and modularity cuts by spectral clustering Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu Ljubjana 2010, October Outline Find
More informationCSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization
CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization April 6, 2018 1 / 34 This material is covered in the textbook, Chapters 9 and 10. Some of the materials are taken from it. Some of
More informationSolving large Semidefinite Programs - Part 1 and 2
Solving large Semidefinite Programs - Part 1 and 2 Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Singapore workshop 2006 p.1/34 Overview Limits of Interior
More informationNotes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012
Notes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012 We present the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More informationSymmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems Etienne de Klerk Marianna E.-Nagy Renata Sotirov Uwe Truetsch March 12, 214 Abstract The reformulation-linearization
More informationarxiv: v1 [math.oc] 23 Nov 2012
arxiv:1211.5406v1 [math.oc] 23 Nov 2012 The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems Abstract Chuan-Hao Guo a,, Yan-Qin Bai
More informationSemidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry
Semidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry assoc. prof., Ph.D. 1 1 UNM - Faculty of information studies Edinburgh, 16. September 2014 Outline Introduction Definition
More informationFour new upper bounds for the stability number of a graph
Four new upper bounds for the stability number of a graph Miklós Ujvári Abstract. In 1979, L. Lovász defined the theta number, a spectral/semidefinite upper bound on the stability number of a graph, which
More informationLecture 10: October 27, 2016
Mathematical Toolkit Autumn 206 Lecturer: Madhur Tulsiani Lecture 0: October 27, 206 The conjugate gradient method In the last lecture we saw the steepest descent or gradient descent method for finding
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA
More informationXLVI Pesquisa Operacional na Gestão da Segurança Pública
A linear formulation with O(n 2 ) variables for the quadratic assignment problem Serigne Gueye and Philippe Michelon Université d Avignon et des Pays du Vaucluse, Laboratoire d Informatique d Avignon (LIA),
More information6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC
6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility
More informationLecture 12 : Graph Laplacians and Cheeger s Inequality
CPS290: Algorithmic Foundations of Data Science March 7, 2017 Lecture 12 : Graph Laplacians and Cheeger s Inequality Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Graph Laplacian Maybe the most beautiful
More informationProjection Results for the k-partition Problem
Projection Results for the k-partition Problem Jamie Fairbrother Adam N. Letchford February 2016 Abstract The k-partition problem is an N P-hard combinatorial optimisation problem with many applications.
More informationSpectral Clustering on Handwritten Digits Database
University of Maryland-College Park Advance Scientific Computing I,II Spectral Clustering on Handwritten Digits Database Author: Danielle Middlebrooks Dmiddle1@math.umd.edu Second year AMSC Student Advisor:
More informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Abstract. We consider the problem of choosing the edge weights of an undirected graph so as to maximize or minimize some function of the
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationA New Spectral Technique Using Normalized Adjacency Matrices for Graph Matching 1
CHAPTER-3 A New Spectral Technique Using Normalized Adjacency Matrices for Graph Matching Graph matching problem has found many applications in areas as diverse as chemical structure analysis, pattern
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationNew Lower Bounds on the Stability Number of a Graph
New Lower Bounds on the Stability Number of a Graph E. Alper Yıldırım June 27, 2007 Abstract Given a simple, undirected graph G, Motzkin and Straus [Canadian Journal of Mathematics, 17 (1965), 533 540]
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.85J / 8.5J Advanced Algorithms Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 8.5/6.85 Advanced Algorithms
More informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationA well-quasi-order for tournaments
A well-quasi-order for tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 June 12, 2009; revised April 19, 2011 1 Supported
More informationGraph Partitioning Using Random Walks
Graph Partitioning Using Random Walks A Convex Optimization Perspective Lorenzo Orecchia Computer Science Why Spectral Algorithms for Graph Problems in practice? Simple to implement Can exploit very efficient
More informationA Note on Representations of Linear Inequalities in Non-Convex Mixed-Integer Quadratic Programs
A Note on Representations of Linear Inequalities in Non-Convex Mixed-Integer Quadratic Programs Adam N. Letchford Daniel J. Grainger To appear in Operations Research Letters Abstract In the literature
More informationChapter 4. Signed Graphs. Intuitively, in a weighted graph, an edge with a positive weight denotes similarity or proximity of its endpoints.
Chapter 4 Signed Graphs 4.1 Signed Graphs and Signed Laplacians Intuitively, in a weighted graph, an edge with a positive weight denotes similarity or proximity of its endpoints. For many reasons, it is
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationCOM Optimization for Communications 8. Semidefinite Programming
COM524500 Optimization for Communications 8. Semidefinite Programming Institute Comm. Eng. & Dept. Elect. Eng., National Tsing Hua University 1 Semidefinite Programming () Inequality form: min c T x s.t.
More informationOn Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
MAHEMAICS OF OPERAIONS RESEARCH Vol. 36, No., February 20, pp. 88 04 issn0364-765x eissn526-547 360 0088 informs doi 0.287/moor.00.0473 20 INFORMS On Equivalence of Semidefinite Relaxations for Quadratic
More informationNote on deleting a vertex and weak interlacing of the Laplacian spectrum
Electronic Journal of Linear Algebra Volume 16 Article 6 2007 Note on deleting a vertex and weak interlacing of the Laplacian spectrum Zvi Lotker zvilo@cse.bgu.ac.il Follow this and additional works at:
More informationLinear Algebra. Shan-Hung Wu. Department of Computer Science, National Tsing Hua University, Taiwan. Large-Scale ML, Fall 2016
Linear Algebra Shan-Hung Wu shwu@cs.nthu.edu.tw Department of Computer Science, National Tsing Hua University, Taiwan Large-Scale ML, Fall 2016 Shan-Hung Wu (CS, NTHU) Linear Algebra Large-Scale ML, Fall
More informationNetworks and Their Spectra
Networks and Their Spectra Victor Amelkin University of California, Santa Barbara Department of Computer Science victor@cs.ucsb.edu December 4, 2017 1 / 18 Introduction Networks (= graphs) are everywhere.
More informationData Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs
Data Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture
More information1 The independent set problem
ORF 523 Lecture 11 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Tuesday, March 29, 2016 When in doubt on the accuracy of these notes, please cross chec with the instructor
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer
More informationPreliminaries Overview OPF and Extensions. Convex Optimization. Lecture 8 - Applications in Smart Grids. Instructor: Yuanzhang Xiao
Convex Optimization Lecture 8 - Applications in Smart Grids Instructor: Yuanzhang Xiao University of Hawaii at Manoa Fall 2017 1 / 32 Today s Lecture 1 Generalized Inequalities and Semidefinite Programming
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More informationThere are several approaches to solve UBQP, we will now briefly discuss some of them:
3 Related Work There are several approaches to solve UBQP, we will now briefly discuss some of them: Since some of them are actually algorithms for the Max Cut problem (MC), it is necessary to show their
More informationON THE QUALITY OF SPECTRAL SEPARATORS
ON THE QUALITY OF SPECTRAL SEPARATORS STEPHEN GUATTERY AND GARY L. MILLER Abstract. Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More informationEigenvalues of 2-edge-coverings
Eigenvalues of -edge-coverings Steve Butler October 3, 007 Abstract A -edge-covering between G and H is an onto homomorphism from the vertices of G to the vertices of H so that each edge is covered twice
More informationDiffusion and random walks on graphs
Diffusion and random walks on graphs Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationJOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES
JOHNSON SCHEMES AND CERTAIN MATRICES WITH INTEGRAL EIGENVALUES AMANDA BURCROFF The University of Michigan Wednesday 6 th September, 2017 Abstract. We are interested in the spectrum of matrices in the adjacency
More informationThe rank of connection matrices and the dimension of graph algebras
The rank of connection matrices and the dimension of graph algebras László Lovász Microsoft Research One Microsoft Way Redmond, WA 98052 August 2004 Microsoft Research Technical Report TR-2004-82 Contents
More informationA STRENGTHENED SDP RELAXATION. via a. SECOND LIFTING for the MAX-CUT PROBLEM. July 15, University of Waterloo. Abstract
A STRENGTHENED SDP RELAXATION via a SECOND LIFTING for the MAX-CUT PROBLEM Miguel Anjos Henry Wolkowicz y July 15, 1999 University of Waterloo Department of Combinatorics and Optimization Waterloo, Ontario
More informationNumerical block diagonalization of matrix -algebras with application to semidefinite programming
Math. Program., Ser. B (2011) 129:91 111 DOI 10.1007/s10107-011-0461-3 FULL LENGTH PAPER Numerical block diagonalization of matrix -algebras with application to semidefinite programming Etienne de Klerk
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationNonnegative Matrices I
Nonnegative Matrices I Daisuke Oyama Topics in Economic Theory September 26, 2017 References J. L. Stuart, Digraphs and Matrices, in Handbook of Linear Algebra, Chapter 29, 2006. R. A. Brualdi and H. J.
More informationMATH 431: FIRST MIDTERM. Thursday, October 3, 2013.
MATH 431: FIRST MIDTERM Thursday, October 3, 213. (1) An inner product on the space of matrices. Let V be the vector space of 2 2 real matrices (that is, the algebra Mat 2 (R), but without the mulitiplicative
More information