A CONIC INTERIOR POINT DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING
|
|
- Bennett Grant
- 6 years ago
- Views:
Transcription
1 A CONIC INTERIOR POINT DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING Kartik Krishnan Sivaramakrishnan Department of Mathematics NC State University kksivara Operations Research Colloquia University of North Carolina at Chapel Hill April 12, 2006
2 Contents Conic programming Motivation for our decomposition approach A decomposition framework for conic programming Semidefinite programming Conic Dantzig-Wolfe decomposition Algorithm Implementational Issues in Algorithm Computational results Conclusions -1-
3 Conic programming (P) min c T x s.t. Ax = b x K (D) max b T y s.t. A T y + s = c s K where A R m n, b R m, c R n, K = K 1... K r r = 1, K = R n + = {x R n : x 0} LP Very large LPs (m, n 1,000,000) solvable by the simplex method and/or IPMs. K i = Q n i + = {x R n i : x 1 x 2:ni } SOCP Large SOCPs (m, n 100,000) solvable by IPMs. K i = S n i + = {X S n i : X 0} SDP Medium sized SDPs (m, n 1000) solvable by IPMs. (Beyond 10,000 seems impossible today!) -2-
4 Motivation (a) Solve large scale structured semidefinite programs (SDP) arising in science and engineering. Typically, these SDPs need not be solved very accurately. (b) The technique is to iteratively solve an SDP between a mixed conic master problem over linear, second order, and semidefinite cones; and distributed subproblems (smaller SDPs) in a high performance computing environment. (c) Improve the scalability of interior point methods (IPMs) by applying them instead on the smaller master problem, and subproblems (which are solved in parallel!) This is our conic interior point decomposition scheme. -3-
5 MIN sum(i=1)^k f_i(x_i) s.t. sum(i=1)^k A_i(X_i) = b COUPLING CONSTRAINTS X_i in C_i, i=1,...,k SUBPROBLEMS MASTER PROBLEM MAX theta(y) where theta(y) = b^ty + sum(i=1)^k theta_i(y) PROPOSALS X_i (PRIVATE VARIABLES) PRICES y (SHARED VARIABLES) theta_1(y) = MIN f_1(x_1) y^ta_1(x_1) s.t. X_1 in C_1 SUBSYSTEM 1 SUBSYSTEM k theta_k(y) = MIN f_k(x_k) y^ta_k(x_k) s.t. X_k in C_k C_i are convex sets defined by LMIs Figure 1: Decomposition by prices
6 Semidefinite programs with a decomposable structure 1. Preprocessed SDPs after matrix completion: Fukuda-Kojima-Nakata-Murota (2000), Lu-Nemirovskii-Monteiro (2004) 2. Stability analysis of interconnected subsystems: Langbort-D Andrea-Xiao-Boyd (2003) 3. Stochastic semidefinite programs: Mehrotra-Ozëvin (2005) 4. Polynomial optimization problems with structured sparsity: Waki-Kim-Kojima-Muramatsu (2005) 5. Semidefinite programs arising in lift and project schemes: Rendl-Sotirov (2003) and Burer-Vandenbussche (2006) -5-
7 Semidefinite programming (SDP) min C X s.t. A(X) = b X 0 (SDD) max b T y s.t. A T y + S = C S 0 Notation - X, S, C S n, b R m - A B = trace(ab) = n i,j=1 A ijb ij (Frobenius inner product) - The operator A : S n R m and its adjoint A T : R m S n are A(X) = A 1 X m., A y = y i A i A m X i=1 where A i S n, i = 1,..., m -6-
8 Assumptions (1) A 1,..., A m are linearly independent in S n. (2) Slater condition for (SDP) and (SDD): {X S n : A(X) = b, X 0} {(y, S) R m S n : A T y + S = C, S 0} (3) One of the constraints in (SDP) is I X = 1 (trace(x) = 1). (Every SDP with a bounded primal feasible set can be reformulated to satisfy this assumption) -7-
9 One sample SDP 1. Consider the following integer quadratic program min x T Lx s.t. x i { 1, 1} n, i = 1,..., n 2. Setting X = xx T, gives an equivalent formulation min L X s.t. X ii = 1, i = 1,..., n X 0 rank(x) = 1 3. Dropping the rank constraint gives an SDP relaxation min L X s.t. X ii = 1, i = 1,..., n X 0 4. Note trace(x) = n in this example. -8-
10 Conic Dantzig-Wolfe decomposition Our semidefinite programs are: Consider the set: The extreme points of E are: (SDP) min C X s.t. A(X) = b trace(x) = 1 X 0 (SDD) max b T y + z s.t. A T y + zi + S = C S 0 E = {X S n : trace(x) = 1, X 0} {vv T : v R n, v T v = 1} (Infinite number) -9-
11 Conic Dantzig-Wolfe decomposition: Primal motivation Any X E can be written as: (1) X = j λ jd j d T j where j λ j = 1, λ j 0 X 0 is replaced by λ j 0, j (Semi-infinite LP formulation) (2) X = j P jv j P T j where j trace(v j) = 1, V j S 2 + X 0 is replaced by V j 0, j (Semi-infinite SOCP formulation) (A 2 2 SDP constraint can be written as a size 3 SOCP constraint) (3) X = j P jv j P T j where j trace(v j) = 1, V j S r j +, r j 3 X 0 is replaced by V j 0, j (Semi-infinite SDP formulation) -10-
12 A 2 2 SDP constraint is an SOCP constraint of size 3 X = ( ) X11 X 12 X 12 X 22 0 X 11 0, X 22 0, X 11 X 22 X X 11 + X 22 2X 12 X 11 X 22 Q 0-11-
13 Conic Dantzig-Wolfe decomposition: Dual motivation (1) LP formulation: S 0 d T j Sd j 0, j (if we take a finite number of constraints we obtain an LP relaxation) (2) SOCP formulation: S 0 P T j SP j }{{} 2 2 0, j (finite number of constraints gives SOCP relaxation) (3) SDP formulation: S 0 P T j SP j }{{} 0, j (r j 3, j) r j r j (finite number of constraints gives SDP relaxation) -12-
14 Conic Dantzig-Wolfe decomposition: Master problem The decomposed conic problem over LP, SOCP and SDP blocks is: Primal Dual min s.t. n l c li x li + c T qjx qj + C sk X sk i=1 n l n q j=1 n s k=1 A li x li + A qj x qj + A sk (X sk ) = b i=1 n l n q j=1 n s k=1 x li + x qj1 + trace(x sk ) = 1 i=1 n q j=1 n s k=1 x li 0, i = 1,..., n l x qj Q 0, j = 1,..., n q X sk 0, k = 1,..., n s max b T y + z s.t. A T li y + z + s li = 1 c li, i = 1,..., n l A T qj y + z 0 + s qj 0 = c qj, j = 1,..., n q A T sk y + zi r k + S sk = C sk, k = 1,..., n s s li 0, i = 1,..., n l s qj Q 0, j = 1,..., n q S sk 0, k = 1,..., n s -13-
15 Conic Dantzig-Wolfe decomposition: Separation Oracle Input: (y, z ) a feasible point for dual master problem. If λ min (S ) 0, report feasibility STOP. Else, solve the following subproblem for X : min (C A T y z I) X s.t. I X = 1 X 0 Factorize X = DMD T with M 0. Return the cut D T (C A T y zi)d 0 with D R n r. If r = 1 is an LP cut. If r = 2 is an SOCP cut. If r 3 is an SDP cut of small size. -14-
16 Figure 2: Conic Dantzig-Wolfe Algorithm First Prev Next Last Go Back Full Screen Close Quit
17 Choice of the query point: I In the original Dantzig-Wolfe (Kelley) scheme the query point (y, z) is an optimal solution to the dual master problem. This scheme has a poor rate of convergence. Better to solve the master problem approximately initially, and gradually tighten this tolerance as the algorithm proceeds. Initially, the master problem is a poor approximation to the SDP problem. Weak tolerance Central dual iterates (y, z) Oracle returns better cuts As the algorithm proceeds, the master problem approximations get tighter. Tight tolerance More emphasis on the objective function Convergence to an optimal solution -16-
18 Our adaptive strategy: Choice of the query point : 2 Solve the master problem to a tolerance TOL for (x, y, z, s ). Compute the following parameters: GAPTOL(x, s ) = x T s max{1, 1 2 (ct x +b T y )} λ min (C A T y z I) max{1, 1 2 (ct x +b T y )} INF(y, z ) = OPT(x, y, z, s ) = max{gaptol(x, s ), INF(y, z )} If OPT(x, y, z, s ) < TOL, we lower TOL by a constant factor. More precisely, TOL = µ OPT(x, y, z, s ) with 0 < µ < 1. Else, TOL remains unchanged. -17-
19 Figure 3: The complete algorithm First Prev Next Last Go Back Full Screen Close Quit
20 (y,z) space y New feasible region (SDD) feasible region A D B z New (y,z) Cutting plane C A Central path Old (y,z) Feasible region of dual master problem A : Solve master problem to tolerance TOL B : Oracle returns a cutting plane C : Restoring dual feasibility D : Warm start Figure 4: One iteration of algorithm First Prev Next Last Go Back Full Screen Close Quit
21 Upper and lower bounds The objective value of the primal master problem in every iteration gives an upper bound on the SDP objective value. This is the objective value of the dual master problem plus the duality gap. Given a solution (y, z ) to the dual master problem in every iteration, a lower bound is computed as follows: Compute λ = λ min (S ), where S = (C A T y z I). Set y lb = y and z lb = z + λ. A lower bound on the SDP objective value is then b t y lb + z lb Note: (y lb, z lb ) is a feasible point in (SDD). We could also terminate if the difference between these bounds is small. -20-
22 Warm start after adding a column: 1 The solution to the old master problem is (x l, x s, y, s l, s s). Consider one linear cut a T l y d in the dual master problem. The new master problem is : min c T l x l + c T s x s + d T β s.t. A l x l + A s x s + a l β = b x l 0, β 0 x s 0. max b T y s.t. s l = c l A T l y 0 s s = c s A T s y Q 0 γ = d a T l y 0 We have γ < 0. We can perturb y (lower bounding) to generate y lb so that γ lb = 0. The perturbed point (x l, x s, β, y lb, s lb l, s lb s, γ lb ) is feasible in the new master problem with β = γ lb = 0, but NOT STRICTLY!. We want to increase β and γ lb from their current zero values, while limiting the variation in the other variables. -21-
23 Warm start after adding a column: 2 We solve the following problems (WSP) max log β s.t. A l x l + A s x s + a l β = 0 D 1 l x l 2 + Ds 1 x s 2 1 β 0. (WSD) max log γ s.t. a T l y + γ = 0 Dl A T l y 2 + D s A T s y 2 1 γ 0. for ( x l, x s, β) and ( y, γ) respectively. Here D l and D s are appropriate primal-dual scaling matrices for linear and semidefinite blocks at (x l, x s, s lb l, s lb s ). Compute ( s l, s s ) = ( A T l y, A T s y). -22-
24 Warm start after adding a column: 3 The solutions to (WSP) and (WSD) are given by x l = D 2 l A T l (A l D 2 l A T l + A s D 2 sa T s ) 1 a l β x s = D 2 qa T q (A l D 2 l A T l + A s D 2 sa T s ) 1 a l β y = (A l D 2 l A T l + A s D 2 sa T s ) 1 a l β γ = V β where β R is the solution to min{ 1 2 βt V β log β : β 0} where V = a T l (A l D 2 l A T l + A s D 2 sa T s ) 1 a l. Finally set (x st l, x st s, β st ) = (x l + καmax x p l, x s + καmax x p s, καmaxβ) p y st = yl lb + καmax y d + καmax s d l, s lb s + καmax s d s, καmaxγ) d (s st l, s st s, γ st ) = (s lb l where κ (0, 1) and α p max, α d max are the maximal primal and dual step lengths respectively. -23-
25 Warm start after adding a matrix: 1 The solution to the old master problem is (x l, x s, y, s l, s s). Consider adding a semidefinite cut a T s y d in the dual master problem. The new master problem is : min c T l x l + c T s x s + d T β s.t. A l x l + A s x s + a s β = b x l 0, β 0 x s 0. max b T y s.t. s l = c l A T l y 0 s s = c s A T s y 0 γ = d a T s y 0 We have γ 0. We can perturb y (lower bounding) to generate y lb so that γ lb 0. The perturbed point (x l, x s, β, y lb, s lb l, s lb s, γ lb ) is feasible in the new master problem with β 0 and γ lb 0, but NOT STRICTLY!. We want to increase β and γ lb, making them strictly feasible, while limiting the variation in the other variables. -24-
26 Warm start after adding a matrix: 2 We solve the following problems (WSP) max log det β s.t. A l x l + A s x s + a s β = 0 D 1 l x l 2 + Ds 1 x s 2 1 β 0. (WSD) max log det γ s.t. a T s y + γ = 0 Dl A T l y 2 + D s A T s y 2 1 γ 0. for ( x l, x s, β) and ( y, γ) respectively. Here D l and D s are appropriate primal-dual scaling matrices for LP and SDP blocks at (x l, x s, s lb l, s lb s ). Compute ( s l, s s ) = ( A T l y, A T s y). -25-
27 Warm start after adding a matrix: 3 Compute x l = D 2 l A T l (A l D 2 l A T l + A s D 2 sa T s ) 1 a s β x s = D 2 sa T q (A l D 2 l A T l + A s D 2 sa T s ) 1 a s β y = (A l D 2 l A T l + A s D 2 sa T s ) 1 a s β γ = V β where β S p is the solution to min{ p 2 βt V β log det β : β 0} where V = a T s (A l D 2 l A T l + A s D 2 sa T s ) 1 a s. Finally set (x st l, x st s, β st ) = (x l + καmax x p l, x s + καmax x p s, καmaxβ) p y st = yl lb + καmax y d + καmax s d l, s lb s + καmax s d s, καmaxγ) d (s st l, s st s, γ st ) = (s lb l where κ (0, 1) and α p max, α d max are the maximal primal and dual step lengths respectively. -26-
28 Aggregating unimportant blocks Use a primal-dual scaling measure to evaluate blocks: For the ith linear block the measure is x i s i. For the jth semidefinite block the measure is trace(x j) trace(s j ). Blocks with small measure are aggregated in an LP block. The resulting master problem is min c agg x agg + c T l x l + c T s x s s.t. A agg x agg + A l x l + A s x s = b x l 0, x agg 0 x s 0. max b T y s.t. s l = c l A T l y 0 s s = c s A T s y 0 s agg = c agg A T aggy 0-27-
29 Computational Results Matlab code with the following features: Master problem contains linear and semidefinite blocks only. SDPT3 is used as conic solver for master problem with H.K.M. scaling Oracle is implemented using MATLAB s Lanczos solver (eigs), which computes the r = m most negative eigenvalues and eigenvectors 2 of S in each iteration. Solve the problem for m iterations, or until TOL = 1e 3, whichever comes earlier. All computational results on a 2.4 GHz processor with 1 GB of memory. -28-
30 Computational results for Max-Cut Problem n Opt LP SDP Lower ɛ Time value cones cones bound (h:m:s) mcp (31) e-3 16 mcp (48) e-3 34 mcp (36) e-3 25 mcp (35) e-3 22 mcp (41) e-3 21 mcp (84) e-3 2:03 mcp (51) e-3 1:05 mcp (44) e-3 49 mcp (43) e-3 47 mcp (115) e-3 12:29 mcp (70) e-3 6:18 mcp (57) e-3 4:33 mcp (49) e-3 2:51 toruspm (84) e-3 9:28 torusg (89) e maxg (84) e-3 1:49:55 maxg (54) e-3 32:24 First Prev Next Last Go Back Full Screen Close Quit
31 0 100 Lower Bound Upper Bound Optimal Value Objective Value for maxg Iteration Number Figure 5: Variation of bounds for maxg11 problem
32 1 0 1 log(epsilon) Iteration Number Figure 6: Variation of error for maxg11 problem
33 Rest of code 3% 13% Subproblem 20% Warm Start 64% Master Problem Figure 7: Distribution of times for maxg11 problem
34 Computational results for graph partitioning Problem n Opt LP SDP Lower ɛ Time value cones cones bound (h:m:s) gpp (23) e-3 50 gpp (52) e-2 1:35 gpp (39) e-3 1:24 gpp (42) e-3 50 gpp (39) e-3 43 gpp (66) e-2 10:24 gpp (49) e-3 10:11 gpp (50) e-3 3:55 gpp (53) e-3 3:49 gpp (92) e-2 1:48:23 gpp (65) e-3 2:11:08 gpp (63) e-3 40:21 gpp (56) e-3 26:22 bm (339) e-2 26:31:13-33-
35 Computational results for Lovasz theta Problem n m Opt LP SDP Lower ɛ Time value blocks blocks bound (h:m:s) theta (35) e-3 1:09 theta (37) e-3 38:20 theta (40) e-3 5:15:52-34-
36 Computational results on random semidefinite programs max b T y + z s.t. S = (C A T y zi) 0 l y u. Prob n m Den LP SDP Our Our SDPT3 SDPT3 cones cones LB (h:m:s) LB (h:m:s) test (9) : test (28) : :32 test (25) : :31 test (29) : :35 test (12) : :03 test (19) : test (21) : :13 test (18) : :11-35-
37 Ongoing and Future work Applying the conic interior point decomposition approach for structured block angular SDPs in a parallel computing environment. (an ongoing project with Brian Borchers at New Mexico Tech) Incorporating the decomposition scheme in the pricing phase of an SDP based conic branch-cut-price scheme for mixed integer and non-convex problems. -36-
38 Consider the SDP Preprocessing sparse SDPs into block-angular SDPs: 1 min L X s.t. X ii = 1, i = 1,..., n, X 0, where L is the adjacency matrix of the graph C2 = (2,3,4,6) C2 C4 = (5,6,7) C4 C3 C1 = (1,5,7) C1 C3 = (4,6,7) GRAPH CHORDAL EXTENSION OF GRAPH -37-
39 Preprocessing sparse SDPs into block-angular SDPs: 2 Using matrix completion, one can reformulate the earlier SDP as min 4 (L k X k ) k=1 s.t. X23 1 X13 4 = 0, X34 2 X12 3 = 0, X23 3 X23 4 = 0, Xii k = 1, i = 1,..., C k, k = 1,..., 4, X k 0, k = 1,..., 4, which is in block-angular form. -38-
40 Thank you for your attention!. Questions, Comments, Suggestions? The slides from this talk are available online at kksivara/ publications/unc-or.pdf A technical report appears at kksivara/ publications/conic-ipm-decomposition.pdf -39-
41 Bibliography: 1 1. K. Sivaramakrishnan, A conic interior point decomposition for large scale structured block angular semidefinite programs, forthcoming. 2. K. Sivaramakrishnan, G. Plaza, and T. Terlaky, A conic interior point decomposition approach for semidefinite programming, submitted. kksivara/publications/conic-ipm-decomposition.pdf 3. L. Lasdon, Optimization Theory for Large Systems, Dover Publications Inc., A. Ruszczyński, Nonlinear Optimization, Princeton University Press, J.B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer Verlag, New York, R.H. Tütüncü, K.C. Toh, and M.J. Todd, Solving semidefinite-quadratic-linear programs using SDPT3, Mathematical Programming, 95(2003), pp mattohkc/sdpt3.html 7. B. Borchers, SDPLIB 1.2, A library of semidefinite programming test problems, Optimization Methods and Software, 11, 1999, pp sdplib/ 8. DIMACS 7 th challenge M. Fukuda, M. Kojima, K. Murota, and K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion I: General framework, SIAM Journal on Optimization, 11(2000), pp
42 Bibliography: Z. Lu, A. Nemirovskii, and R.D.C. Monteiro, Large scale semidefinite programming via saddle point mirror-prox algorithm. HTML/2004/11/998.html 11. C. Langbort, R. D Andrea, L. Xiao, and S. Boyd, A decomposition approach to distributed analysis of networked systems, Proceedings of the 43rd IEEE Conference on Decision and Control, pp boyd/distr contr cdc04.html 12. S. Mehrotra and M.G. Özevin, On the implementation of interior point decomposition algorithms for two-stage stochastic conic programs. HTML/2005/10/1237.html 13. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, Sums of squares and semidefinite programming relaxations for polynomial problems with structured sparsity. HTML/2004/10/988.html 14. F. Rendl and R. Sotirov, Bounds for the quadratic assignment problem using the bundle method. HTML/2003/08/712.html 15. S. Burer and D. Vandenbussche, Solving lift-and-project relaxations of binary integer programs, SIAM Journal on Optimization, 16(2006), pp
43 Bibliography: M.R. Oskoorouchi and J.L.Goffin, A matrix generation approach for eigenvalue optimization C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, SIAM Journal on Optimization, 10(2000), pp K. Sivaramakrishnan and J.E. Mitchell, A semidefinite programming based polyhedral cut and price algorithm for the maxcut problem, Computational Optimization and Applications, 33(2006), pp
A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING
A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING Kartik Krishnan Advanced Optimization Laboratory McMaster University Joint work with Gema Plaza Martinez and Tamás
More informationA PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS IN POLYNOMIAL OPTIMIZATION
A PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS IN POLYNOMIAL OPTIMIZATION Kartik K. Sivaramakrishnan Department of Mathematics North Carolina State University
More informationA PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS
A PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS Kartik K. Sivaramakrishnan Department of Mathematics North Carolina State University kksivara@ncsu.edu http://www4.ncsu.edu/
More informationA PARALLEL TWO-STAGE INTERIOR POINT DECOMPOSITION ALGORITHM FOR LARGE SCALE STRUCTURED SEMIDEFINITE PROGRAMS
A PARALLEL TWO-STAGE INTERIOR POINT DECOMPOSITION ALGORITHM FOR LARGE SCALE STRUCTURED SEMIDEFINITE PROGRAMS Kartik K. Sivaramakrishnan Research Division Axioma, Inc., Atlanta kksivara@axiomainc.com http://www4.ncsu.edu/
More informationA conic interior point decomposition approach for large scale semidefinite programming
A conic interior point decomposition approach for large scale semidefinite programming Kartik Sivaramakrishnan 1 Department of Mathematics North Carolina State University Raleigh, NC 27695-8205 kksivara@ncsu.edu
More informationProperties of a Cutting Plane Method for Semidefinite Programming 1
Properties of a Cutting Plane Method for Semidefinite Programming 1 Kartik Krishnan Sivaramakrishnan Axioma, Inc. Atlanta, GA 30350 kksivara@gmail.com http://www4.ncsu.edu/ kksivara John E. Mitchell Mathematical
More informationSecond Order Cone Programming Relaxation of Positive Semidefinite Constraint
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationParallel implementation of primal-dual interior-point methods for semidefinite programs
Parallel implementation of primal-dual interior-point methods for semidefinite programs Masakazu Kojima, Kazuhide Nakata Katsuki Fujisawa and Makoto Yamashita 3rd Annual McMaster Optimization Conference:
More informationarxiv: v1 [math.oc] 26 Sep 2015
arxiv:1509.08021v1 [math.oc] 26 Sep 2015 Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Arvind U. Raghunathan and Andrew V. Knyazev Mitsubishi Electric Research Laboratories 201 Broadway,
More informationCroatian Operational Research Review (CRORR), Vol. 3, 2012
126 127 128 129 130 131 132 133 REFERENCES [BM03] S. Burer and R.D.C. Monteiro (2003), A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming
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 informationPrimal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization
Primal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization Robert M. Freund M.I.T. June, 2010 from papers in SIOPT, Mathematics
More informationThe Ongoing Development of CSDP
The Ongoing Development of CSDP Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.edu Joseph Young Department of Mathematics New Mexico Tech (Now at Rice University)
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 informationA NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
Journal of the Operations Research Society of Japan 2003, Vol. 46, No. 2, 164-177 2003 The Operations Research Society of Japan A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS Masakazu
More informationProjection methods to solve SDP
Projection methods to solve SDP Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Oberwolfach Seminar, May 2010 p.1/32 Overview Augmented Primal-Dual Method
More informationDegeneracy in Maximal Clique Decomposition for Semidefinite Programs
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Raghunathan, A.U.; Knyazev, A. TR2016-040 July 2016 Abstract Exploiting
More informationSecond Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems
Second Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems Sunyoung Kim Department of Mathematics, Ewha Women s University 11-1 Dahyun-dong, Sudaemoon-gu, Seoul 120-750 Korea
More informationIntroduction to Semidefinite Programs
Introduction to Semidefinite Programs Masakazu Kojima, Tokyo Institute of Technology Semidefinite Programming and Its Application January, 2006 Institute for Mathematical Sciences National University of
More informationThe LP approach potentially allows one to approximately solve large scale semidefinite programs using state of the art linear solvers. Moreover one ca
Semi-infinite linear programming approaches to semidefinite programming problems Λy Kartik Krishnan z John E. Mitchell x December 9, 2002 Abstract Interior point methods, the traditional methods for the
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 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 informationLecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.
MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationUsing quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Noname manuscript No. (will be inserted by the editor) Using quadratic conve reformulation to tighten the conve relaation of a quadratic program with complementarity constraints Lijie Bai John E. Mitchell
More informationFast ADMM for Sum of Squares Programs Using Partial Orthogonality
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford www.eng.ox.ac.uk/control/sysos antonis@eng.ox.ac.uk with
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 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 informationIII. Applications in convex optimization
III. Applications in convex optimization nonsymmetric interior-point methods partial separability and decomposition partial separability first order methods interior-point methods Conic linear optimization
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More informationImplementation and Evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0)
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
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 informationSDPARA : SemiDefinite Programming Algorithm PARAllel version
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More information1 Solution of a Large-Scale Traveling-Salesman Problem... 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson
Part I The Early Years 1 Solution of a Large-Scale Traveling-Salesman Problem............ 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson 2 The Hungarian Method for the Assignment Problem..............
More informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley A. d Aspremont, INFORMS, Denver,
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 informationResearch Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We
More informationA priori bounds on the condition numbers in interior-point methods
A priori bounds on the condition numbers in interior-point methods Florian Jarre, Mathematisches Institut, Heinrich-Heine Universität Düsseldorf, Germany. Abstract Interior-point methods are known to be
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 informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon
More informationPENNON A Generalized Augmented Lagrangian Method for Convex NLP and SDP p.1/39
PENNON A Generalized Augmented Lagrangian Method for Convex NLP and SDP Michal Kočvara Institute of Information Theory and Automation Academy of Sciences of the Czech Republic and Czech Technical University
More informationAdvances in Convex Optimization: Theory, Algorithms, and Applications
Advances in Convex Optimization: Theory, Algorithms, and Applications Stephen Boyd Electrical Engineering Department Stanford University (joint work with Lieven Vandenberghe, UCLA) ISIT 02 ISIT 02 Lausanne
More informationSparse PCA with applications in finance
Sparse PCA with applications in finance A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon 1 Introduction
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming
E5295/5B5749 Convex optimization with engineering applications Lecture 5 Convex programming and semidefinite programming A. Forsgren, KTH 1 Lecture 5 Convex optimization 2006/2007 Convex quadratic program
More informationHow to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization
CS-11-01 How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization Hayato Waki Department of Computer Science, The University of Electro-Communications
More informationDistributed Control of Connected Vehicles and Fast ADMM for Sparse SDPs
Distributed Control of Connected Vehicles and Fast ADMM for Sparse SDPs Yang Zheng Department of Engineering Science, University of Oxford Homepage: http://users.ox.ac.uk/~ball4503/index.html Talk at Cranfield
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 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 information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
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 informationInterior-Point versus Simplex methods for Integer Programming Branch-and-Bound
Interior-Point versus Simplex methods for Integer Programming Branch-and-Bound Samir Elhedhli elhedhli@uwaterloo.ca Department of Management Sciences, University of Waterloo, Canada Page of 4 McMaster
More informationLecture: Algorithms for LP, SOCP and SDP
1/53 Lecture: Algorithms for LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More informationSemidefinite Programming
Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationl p -Norm Constrained Quadratic Programming: Conic Approximation Methods
OUTLINE l p -Norm Constrained Quadratic Programming: Conic Approximation Methods Wenxun Xing Department of Mathematical Sciences Tsinghua University, Beijing Email: wxing@math.tsinghua.edu.cn OUTLINE OUTLINE
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationOutline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column
More informationPENNON A Code for Convex Nonlinear and Semidefinite Programming
PENNON A Code for Convex Nonlinear and Semidefinite Programming Michal Kočvara Michael Stingl Abstract We introduce a computer program PENNON for the solution of problems of convex Nonlinear and Semidefinite
More informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationRelations between Semidefinite, Copositive, Semi-infinite and Integer Programming
Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming Author: Faizan Ahmed Supervisor: Dr. Georg Still Master Thesis University of Twente the Netherlands May 2010 Relations
More informationInteger Programming Reformulations: Dantzig-Wolfe & Benders Decomposition the Coluna Software Platform
Integer Programming Reformulations: Dantzig-Wolfe & Benders Decomposition the Coluna Software Platform François Vanderbeck B. Detienne, F. Clautiaux, R. Griset, T. Leite, G. Marques, V. Nesello, A. Pessoa,
More informationA General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationLecture 7: Convex Optimizations
Lecture 7: Convex Optimizations Radu Balan, David Levermore March 29, 2018 Convex Sets. Convex Functions A set S R n is called a convex set if for any points x, y S the line segment [x, y] := {tx + (1
More informationA semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint
Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite
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 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 informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationIdentifying Redundant Linear Constraints in Systems of Linear Matrix. Inequality Constraints. Shafiu Jibrin
Identifying Redundant Linear Constraints in Systems of Linear Matrix Inequality Constraints Shafiu Jibrin (shafiu.jibrin@nau.edu) Department of Mathematics and Statistics Northern Arizona University, Flagstaff
More informationThe Trust Region Subproblem with Non-Intersecting Linear Constraints
The Trust Region Subproblem with Non-Intersecting Linear Constraints Samuel Burer Boshi Yang February 21, 2013 Abstract This paper studies an extended trust region subproblem (etrs in which the trust region
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 informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Correlative sparsity in primal-dual interior-point methods for LP, SDP and SOCP Kazuhiro Kobayashi, Sunyoung Kim and Masakazu Kojima
More informationSparse Optimization Lecture: Basic Sparse Optimization Models
Sparse Optimization Lecture: Basic Sparse Optimization Models Instructor: Wotao Yin July 2013 online discussions on piazza.com Those who complete this lecture will know basic l 1, l 2,1, and nuclear-norm
More informationAgenda. Interior Point Methods. 1 Barrier functions. 2 Analytic center. 3 Central path. 4 Barrier method. 5 Primal-dual path following algorithms
Agenda Interior Point Methods 1 Barrier functions 2 Analytic center 3 Central path 4 Barrier method 5 Primal-dual path following algorithms 6 Nesterov Todd scaling 7 Complexity analysis Interior point
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Exact SDP Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Exact SDP Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems Shinsaku SAKAUE, Akiko TAKEDA, Sunyoung KIM, and Naoki ITO METR
More informationResearch overview. Seminar September 4, Lehigh University Department of Industrial & Systems Engineering. Research overview.
Research overview Lehigh University Department of Industrial & Systems Engineering COR@L Seminar September 4, 2008 1 Duality without regularity condition Duality in non-exact arithmetic 2 interior point
More informationSUCCESSIVE LINEARIZATION METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMS 1. Preprint 252 August 2003
SUCCESSIVE LINEARIZATION METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMS 1 Christian Kanzow 2, Christian Nagel 2 and Masao Fukushima 3 Preprint 252 August 2003 2 University of Würzburg Institute of Applied
More informationSparse Matrix Theory and Semidefinite Optimization
Sparse Matrix Theory and Semidefinite Optimization Lieven Vandenberghe Department of Electrical Engineering University of California, Los Angeles Joint work with Martin S. Andersen and Yifan Sun Third
More informationConvexification of Mixed-Integer Quadratically Constrained Quadratic Programs
Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Laura Galli 1 Adam N. Letchford 2 Lancaster, April 2011 1 DEIS, University of Bologna, Italy 2 Department of Management Science,
More informationFacial Reduction and Geometry on Conic Programming
Facial Reduction and Geometry on Conic Programming Masakazu Muramatsu UEC Bruno F. Lourenço, and Takashi Tsuchiya Seikei University GRIPS Based on the papers of LMT: 1. A structural geometrical analysis
More informationInterior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems
AMSC 607 / CMSC 764 Advanced Numerical Optimization Fall 2008 UNIT 3: Constrained Optimization PART 4: Introduction to Interior Point Methods Dianne P. O Leary c 2008 Interior Point Methods We ll discuss
More informationFeasibility Pump Heuristics for Column Generation Approaches
1 / 29 Feasibility Pump Heuristics for Column Generation Approaches Ruslan Sadykov 2 Pierre Pesneau 1,2 Francois Vanderbeck 1,2 1 University Bordeaux I 2 INRIA Bordeaux Sud-Ouest SEA 2012 Bordeaux, France,
More informationOptimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation
Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation Amir Ali Ahmadi Princeton, ORFE a a a@princeton.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 8, 2016
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationContinuous Optimisation, Chpt 9: Semidefinite Problems
Continuous Optimisation, Chpt 9: Semidefinite Problems Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2016co.html version: 21/11/16 Monday
More informationConic optimization under combinatorial sparsity constraints
Conic optimization under combinatorial sparsity constraints Christoph Buchheim and Emiliano Traversi Abstract We present a heuristic approach for conic optimization problems containing sparsity constraints.
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 informationApproximation Algorithms from Inexact Solutions to Semidefinite Programming Relaxations of Combinatorial Optimization Problems
Approximation Algorithms from Inexact Solutions to Semidefinite Programming Relaxations of Combinatorial Optimization Problems Timothy Lee a, John E. Mitchell,b a KISTERS North America, Citrus Heights
More information1 Outline Part I: Linear Programming (LP) Interior-Point Approach 1. Simplex Approach Comparison Part II: Semidenite Programming (SDP) Concludin
Sensitivity Analysis in LP and SDP Using Interior-Point Methods E. Alper Yldrm School of Operations Research and Industrial Engineering Cornell University Ithaca, NY joint with Michael J. Todd INFORMS
More informationPOLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS
POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and
More informationInfeasible Primal-Dual (Path-Following) Interior-Point Methods for Semidefinite Programming*
Infeasible Primal-Dual (Path-Following) Interior-Point Methods for Semidefinite Programming* Notes for CAAM 564, Spring 2012 Dept of CAAM, Rice University Outline (1) Introduction (2) Formulation & a complexity
More informationA solution approach for linear optimization with completely positive matrices
A solution approach for linear optimization with completely positive matrices Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F.
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationLagrange Relaxation: Introduction and Applications
1 / 23 Lagrange Relaxation: Introduction and Applications Operations Research Anthony Papavasiliou 2 / 23 Contents 1 Context 2 Applications Application in Stochastic Programming Unit Commitment 3 / 23
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 informationRobust and Optimal Control, Spring 2015
Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5-303B) G. Sum of Squares (SOS) G.1 SOS Program: SOS/PSD and SDP G.2 Duality, valid ineqalities and Cone G.3 Feasibility/Optimization
More information1. Introduction. Consider the following quadratic binary optimization problem,
ON DUALITY GAP IN BINARY QUADRATIC PROGRAMMING XIAOLING SUN, CHUNLI LIU, DUAN LI, AND JIANJUN GAO Abstract. We present in this paper new results on the duality gap between the binary quadratic optimization
More informationA Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems
A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems Gábor Pataki gabor@unc.edu Dept. of Statistics and OR University of North Carolina at Chapel Hill Abstract The Facial Reduction
More informationConvex relaxation. In example below, we have N = 6, and the cut we are considering
Convex relaxation The art and science of convex relaxation revolves around taking a non-convex problem that you want to solve, and replacing it with a convex problem which you can actually solve the solution
More informationNonconvex Quadratic Programming: Return of the Boolean Quadric Polytope
Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope Kurt M. Anstreicher Dept. of Management Sciences University of Iowa Seminar, Chinese University of Hong Kong, October 2009 We consider
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 information