Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5

Size: px
Start display at page:

Download "Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5"

Transcription

1 Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/ Overview We continue studying the maximum eigenvalue SDP, and generalize it to an affine set of matrices. Next, we define Lovász Theta function and prove Lovász s sandwich theorem. Finally, we introduce further extensions to the eigenvalue SDP for finding minimum sum of k largest eigenvalues over an affine set of matrices. 2 Finding Largest Eigenvalue (Continued) In the previous lecture we have introduced sets S := {X : tr X = 1, X 0}, E := {qq T : q 2 = 1}. We have shown that E S and members of E are extreme points of S. For a fixed symmetric matrix A we have defined the largest eigenvalue SDP as: The dual to this problem is: λ 1 (A) = min z s.t. zi A λ 1 (A) = max A Y s.t. tr Y = 1 Y 0 1

2 Note that S is exactly the feasible set of the dual. As we know, optimal value is attained at an extreme point of these set, i.e. Y E if and only if Y is an optimal solution of the dual. Thus there exists q such that Y = qq T. So, we can write: Thus, λ 1 (A) = maxy A = λ 1 (A) = max q 2 =1 qqt A = max q 2 =1 qt Aq. max q 2 =1 qt Aq, (1) which is a well-known result from linear algebra, that we have proven using semi-definite programming duality. Note 1 Similarly we can show that the smallest eigenvalue λ n (A) can be expressed as: λ n (A) = min q 2 =1 qt Aq. 3 Lovász Theta Function In this section we describe extensions of the largest eigenvalue problem. Interested students are referred to the classic book Geometric Algorithms and Combinatorial Optimization by M. Grötschel, L. Lovász and A. Schrijver, Chapter Optimizing Largest Eigenvalue Over an Affine Set Suppose now that we are solving the same largest eigenvalue problem, but the matrix A is not fixed, and we are looking for a way to minimize the largest eigenvalue over a set of matrices. For example, consider the linear combination of symmetric matrices, A := A 0 + x 1 A x m A m. The problem in this case translates into the following unconstrained optimization problem: min λ 1(A 0 + x 1 A x m A m ). x R m It can be shown that this function is not linear. Furthermore, it is not smooth, and this makes optimization a very difficult task. However, we will prove that this function is convex, and therefore the task of finding it s minimum should be tractable. Proposition 1 Function f(x) := λ 1 (A 0 + x 1 A x m A m ) is convex. Proof: We will prove that λ 1 (A+B) λ 1 (A)+λ 1 (B), and the result will follow. Using (1), we can state that there exists q such that: λ 1 (A + B) = q T (A + B)q = q T Aq + q T Bq 2

3 The value of q is feasible, but not optimal, if we apply (1) to A and B separately. Therefore, and the result follows. q T Aq + q T Bq λ 1 (A) + λ 1 (B), We can rewrite the problem as an equivalent semidefinite programming problem: min z The dual for this problem is: s.t. zi x 1 A 1 x m A m A 0 max A 0 Y s.t. tr Y = 1 A i Y = 0 Y 0 People have studied this problem from the point of view of unconstrained optimization. It turns out to be a very difficult problem, when formulated this way. The graph of the function is not smooth. Newton method can not be applied directly, since taking derivative is not always possible. Semidefinite programs, in turn, can be solved efficiently with any given precision. We will describe algorithms for solving SDPs later in the course. 3.2 Maximum Clique, Stable Set and Graph Coloring Problems Assume G = (V, E) is an undirected graph, no loops attached to vertices, i.e. edges (i,i) are not allowed in G. Definition 1 Maximum clique problem: find a maximum fully connected subgraph of G (a clique). I.e. find a subgraph G 0 = (V 0, E 0 ), V 0 V, E 0 E such that i, j V 0, i j (i, j) E 0 and V 0 is maximal. The maximum clique problem is NP-complete. In fact, it was one of the original problems shown to be NP-complete. Example 1 (Maximum Clique) Consider the graph on Figure 1. In this graph the cliques of size more than 2 are {2,3,4,5} and {1,2,5}. The former clique is maximum. Definition 2 Maximum independent (or stable) set problem: find a maximum set of vertices none of which are connected with an edge. 3

4 Figure 1: An example of an undirected graph. The maximum independent set problem is in some sense a dual of the maximum clique problem. The maximum independent set of a graph is the maximum clique of its complement. Definition 3 Complement graph Ḡ = (V, Ē) of a graph G = (V, E) is a graph, that has the same set of vertices, and satisfying the following property: every pair of vertices, that is connected in the original graph is not connected in its complement, and vice versa. Example 2 (Stable Set) Using the graph in Figure 1, the optimal solutions are {1,4} and {1,3} Figure 2: Complement of a graph in Figure 1. Example 3 (Complement Graph) Figure 2 shows the complement graph for the graph shown on Figure 1. Note 2 Graph G is a complement of Ḡ. Note 3 Every solution to the maximum stable set problem on a graph G is a solution for the maximum clique problem on the graph Ḡ, and vice versa. Definition 4 Minimum graph coloring problem: assign colors to vertices such that every pair of adjacent vertices has different colors, using the smallest possible total number of colors. The number of colors used in the optimal solution to the problem is referred to as the chromatic number of the graph. 4

5 Finding the chromatic number of a graph is also NP-complete. In fact, it can be proven that there does not exist an ε-approximation algorithm for this problem. In other words, for any given ε 1 it is impossible to give a polynomial algorithm that for every graph G finds a number that is guaranteed to be at most εχ(g), unless P = NP. We will use the following notation to denote optimal values of these problems: ω(g) - size of maximum clique in graph G; α(g) - size of largest stable set in graph G; χ(g) - chromatic number of graph G. Proposition 2 ω(g) χ(g). Proof: The vertices of each clique must have different colors. Example 4 (Strict Inequality) However, the equality does not hold all the time. The example of a cycle of 5 vertices shows that in some cases the inequality above is strict Figure 3: Odd cycle example. It is easy to see that the graph shown in Figure 3 can not be painted with less than 3 colors, therefore χ(g) = 3. However, the largest clique in this graph has only 2 vertices, and ω(g) = 2 < 3 = χ(g). This is actually true for any odd cycle. Proposition 3 If a symmetric matrix A R n n and its submatrix B R k k are such that ( k then A = k B C C T D λ 1 (B) λ 1 (A). Proof: From (1) it follows that there exists q R k, satisfying q 2 = 1, such that: λ 1 (B) = q T Bq. ), 5

6 Recall that the value of vector q, at which maximum in (1) is achieved, is the eigenvector corresponding to the eigenvalue λ 1 (B). Further, λ 1 (B) = q T Bq = ( q T 0 ) ( ) ( ) B C q C T λ D 0 1 (A), where the inequality follows from the fact that vector ( q T optimal for the entire matrix A in terms of (1). 0 ) is not necessarily Corollary 1 If A R n n is a symmetric matrix and its submatrix B R k k is composed of the rows and columns corresponding the same index subsets, i.e. for each column i of A that is included in B, the row i of A is included in B, and vice versa, then λ 1 (B) λ 1 (A). Proof: This corollary states that the submatrix B does not have to be in the corner of A, it can be distributed over A, as long as corresponding rows and columns are participating. We will make use of permutation matrices to prove this. The matrix A can be transformed to have the structure required in Proposition 3 via multiplication to permutation matrices. A permutation matrix is a square matrix composed of 0 and 1 elements, and having only one non-zero in each row and in each column. If the permutation matrix P rearranges columns, when multiplied on the right side, then P T on the left side results in the rearrangement of corresponding columns. Therefore there exists a permutation matrix P such that P T AP has the required structure. It is known from linear algebra that permutation matrices are orthogonal, and P T = P 1. Therefore permutation does not change eigenvalues, and the matrix P T AP has the same eigenvalues as A. Thus, λ 1 (B) λ(p T AP) = λ 1 (A), where the inequality follows from Proposition 3. Let us now apply this result to adjacency matrix A of an arbitrary graph G. An adjacency matrix is defined as A = (a ij ), where a ij = 1 if there exists an edge (i, j), and a ij = 0 otherwise. We will illustrate the procedure on the example graph in Figure 1. For this graph, the adjacency matrix A is A = and A + I = It is easy to see that cliques in the graph correspond to submatrices of ones in the matrix A + I, composed of the corresponding rows and columns. Now we can apply Corollary 1. Thus, for each such clique submatrix J k = 11 T of size k k, λ 1 (J k ) λ 1 (A + I). (2) 6

7 The eigenvalues of J k are easy to compute. It is a rank 1 matrix, therefore it has only one non-zero eigenvalue, and it is easy to see that the vector 1 is the eigenvector corresponding to this non-zero value, and the value itself is equal to k. Thus, λ 1 (J k ) = k. Substituting in (2), k λ 1 (A + I). Since this equation holds for any clique size k, it also holds for the maximum clique size: ω(g) λ 1 (A + I). (3) 3.3 Lovász Theta Function Let us see if the inequality (3) can be made tighter, so we can obtain a better estimate of ω(g). Note that Corollary 1 can still be applied in the same way, and (3) holds, even if the zeros in A + I are replaced with arbitrary values, as long as the matrix A + I remains symmetric. The reason for this is that there are no zeros inside any clique submatrix J k, so that part (corresponding to B in Corollary (1) remains unchanged. Formally, let { 1, if (i, j) E or i = j; [A(x)] ij = x ij = x ji, otherwise. Now we can write a stronger version of inequality (3): ω(g) min x λ 1 (A(x)). (4) Definition 5 The right hand side of (4) is referred to as Lovácz θ-function of a graph. It is denoted θ(g) = min x λ 1 (A (x)). Note that A(x) defined above can be written as A(x) = A 0 + x 1 A 1 + x 2 A x m A m. The example below illustrates how this can be done. Example 5 (Rewriting A(x) as sum) 1 x y x 1 1 = x(e 12 + E 21 ) + y(e 13 + E 31 ) + (A + I). y 1 1 We know that ω(g) χ(g). Now we can formulate the following theorem, that makes a stronger statement. This theorem is also known as Lovász s sandwich theorem. Theorem 1 ω(g) θ(g) χ(g). 7

8 Before we prove this theorem, let us make several observations regarding graph sums. Definition 6 Given graphs G 1 = (V 1, E 1 ), G 2 = (V 2, E 2 ) the sum of graphs G 1 G 2 is a graph formed by putting together graphs G 1 and G 2. In other words, G 1 G 2 = (V 1 V 2, E 1 E 2 ). The following propositions are straightforward to prove, so the proofs are not given. Proposition 4 ω(g 1 G 2 ) = max{ω(g 1 ), ω(g 2 )}. Proposition 5 χ(g 1 G 2 ) = max{χ(g 1 ), χ(g 2 )}. Although given the two propositions above, the following proposition may be anticipated, the proof is not as obvious. Proposition 6 θ(g 1 G 2 ) = max{θ(g 1 ), θ(g 2 )}. Proof: Write an SDP for finding the value of θ(g) : θ(g) = min z s.t. zi X 0 x ij = 1 if i = j or (i, j) E Here is the dual of this problem: max y ij + y ii = (A + I) Y s.t. ij E tr Y = 1 y ij = 0 Y 0 (i, j) E Now let us write the dual for graph composition G 1 G 2. The dual variable will have the following structure (since there are no edges between the graphs in the sum): ( ) Y Y 2 Thus, the dual program is max (A + I) Y 1 + (A + I) Y 2 s.t. tr Y 1 + tr Y 2 = 1 (5) y ij = 0 Y 1, Y 2 0 (i, j) E 8

9 The formulation above resembles the original dual formulation. It could be separated into two problems (for graphs G 1 and G 2 ) and the proposition will be proven immediately, if not for the constraint (5), that makes Y 1 dependent on Y 2. Note that we can replace Y with αy, in the dual problem, for some α > 0, and the objective still remains the same, except that everything is now scaled down by α. Now let us choose an α such that 0 α 1, and replace (5) with the one of following two constraints, and solve the two dual problems: tr Y 1 = α tr Y 2 = 1 α The solutions to these independent problems will be, as we know, αθ(g 1 ) and (1 α)θ(g 2 ) correspondingly. The solution to the dual problem for G 1 G 2 is then: [ max αθ(g1 ) + (1 α)θ(g 2 ) ] = max{θ(g 1 ), θ(g 2 )}, 0 α 1 where the equality follows from the linearity of the optimal solution in α. Now we are ready to prove Theorem 1. Proof: Denote k = χ(g). The nodes of the graph G can be partitioned into k classes according to their color. We can make all classes contain the same number of nodes (r) by introducing additional singleton nodes, that are not connected to any nodes in the graph, and therefore can have any color. This procedure does not change θ(g) according to Proposition 6, since θ of a single vertex is 1. Denote this new graph G 1. Then, θ(g) = θ(g 1 ), V(G 1 ) = kr. Consider matrix A(α) R kr kr, A(α) := (αj r + (1 α)i r ) J r J r J r (αj r + (1 α)i r ) J r J r J r (αj r + (1 α)i r ) Note that (αj r + (1 α)i r ) is a symmetric r r matrix having the following structure: 1 α α α α 1 α α (αj r + (1 α)i r ) = α α 1 α α α α 1 J r, as before, is a matrix of all ones of size r r. It is easy to see that matrix A(α) is a special case of (A(x)) matrix for graph G 1. Vertices within a color class are not connected, and if we rename them so that classes follow one another, we will have zero matrices of size r r 9

10 on the diagonal in adjacency matrix for G 1. Now we can replace all zeros with variables, and we choose to replace some of them with α, which preserves matrix symmetry. Since it is a special case, and by definition of θ(g 1 ), Note that we can rewrite A(α) as: θ(g 1 ) λ 1 (A(α)). A(α) = J kr (1 α)(j r J r J r ) + (1 α)i. (6) Now we would like to find the value of λ 1 (A(α)) as a function of α in closed form, and choose α such that λ 1 (A(α)) k = χ(g 1 ) = χ(g). Note that α does not have to be positive. Eigenvalue of matrix sum is equal to sum of eigenvalues, if the matrices commute. It is known from linear algebra that for matrices A and B, AB = BA if and only if A and B share a system of common eigenvectors. This is almost obvious for symmetric matrices, we can make use of eigenvalue decomposition: A = Q T DQ, B = Q T CQ, then A + B = Q T (D + C)Q if the matrices commute. We claim that J kr, (J r J r J r ) and I commute. I is easy, since it commutes with every matrix. It is also straightforward to verify that the vector of all ones, and everything orthogonal to it, can be taken as eigenvectors for J kr. Vector of all ones is also an eigenvector of (J r J r J r ); thus take any other set of eigenvectors for it, its members are orthogonal to 1, and so are also eigenvectors of J kr, and this proves the claim. The table below summarizes the eigenvalues of the 3 terms in the sum (6): J kr (1 α)(j r J r J r ) (1 α)i kr (1 α)r 1 α α α 0 (1 α)r 1 α α α 0 (1 α)r 1 α α α Thus in order to complete the proof, we need to show that there exists an α that satisfies: kr (1 α)r + (1 α) k 1 α (1 α)r k 1 α k 10

11 Solving the first inequality for α we obtain α 1 k. Solving the last one we get α 1 k. Setting α = 1 k will satisfy all three inequalities. As we have just shown, this theorem proves a bound on a very hard integer program (IP) using results obtained with semidefinite programming (SDP) analysis. Later we will show that any IP can be relaxed to an SDP in a similar way. SDP relaxations are typically tighter than relaxations to linear programs, and we will give a general framework for creating such relaxations. 4 Computing Sums of Eigenvalues Consider further generalization of the optimization problem we have been working with. As before, define A(x) = A 0 + x 1 A 1 + x 2 A x m A m. But now, we want to find the sum of a given number of largest eigenvalues, instead of just finding one largest eigenvalue: f(x 1, x 2,, x n ) = (λ 1 + λ λ k )(A 0 + x 1 A 1 + x 2 A x m A m ). And, as in previous sections, we would like to find the unconstrained minimum: min x f(x 1, x 2,, x n ). We can write an SDP for this problem, but the straightforward approach (writing constraints for all possible sums of eigenvalues) results in an exponential number of constraints. A more sophisticated approach should be used. We will first illustrate the ideas we are going to employ on a small linear program. Example 6 (Linear Programming) Consider the following linear program (LP): max w 1 x w n x n s.t. x1 + + x n = k (7) 0 x i 1 Suppose k is an integer. This program finds the k largest values of w, and sets corresponding values of x to 1. All extreme points of feasible set of LP are integer. This can be proven, for example, using complementary slackness. Let us write the dual of this problem: min s.t. kz + y i z + y i w i y i 0 Now, using complementary slackness, we can show that a fractional solution is either non-optimal, or is not an extreme point. 11

12 Another way to show that all the extreme points of LP are integral is to notice that the matrix of this problem is totally unimodular (all determinants of its sub-matrices are either 0, 1, or 1). Either way, it can be shown that the extreme points of this polytope are 0-1 vectors having exactly k ones in them. Introducing just one constraint on the sum (equation (7) in LP) greatly restricts the degrees of freedom for x. 12

The maximal stable set problem : Copositive programming and Semidefinite Relaxations

The 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 information

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4 Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4 Instructor: Farid Alizadeh Scribe: Haengju Lee 10/1/2001 1 Overview We examine the dual of the Fermat-Weber Problem. Next we will

More information

Introduction to Semidefinite Programming I: Basic properties a

Introduction 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 information

CSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming

CSC 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

Four new upper bounds for the stability number of a graph

Four 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 information

Lecture 4: January 26

Lecture 4: January 26 10-725/36-725: Conve Optimization Spring 2015 Lecturer: Javier Pena Lecture 4: January 26 Scribes: Vipul Singh, Shinjini Kundu, Chia-Yin Tsai Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer:

More information

1 The independent set problem

1 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 information

Reducing graph coloring to stable set without symmetry

Reducing graph coloring to stable set without symmetry Reducing graph coloring to stable set without symmetry Denis Cornaz (with V. Jost, with P. Meurdesoif) LAMSADE, Paris-Dauphine SPOC 11 Cornaz (with Jost and Meurdesoif) Coloring without symmetry SPOC 11

More information

Modeling with semidefinite and copositive matrices

Modeling 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 information

Chapter 3. Some Applications. 3.1 The Cone of Positive Semidefinite Matrices

Chapter 3. Some Applications. 3.1 The Cone of Positive Semidefinite Matrices Chapter 3 Some Applications Having developed the basic theory of cone programming, it is time to apply it to our actual subject, namely that of semidefinite programming. Indeed, any semidefinite program

More information

Lectures 6, 7 and part of 8

Lectures 6, 7 and part of 8 Lectures 6, 7 and part of 8 Uriel Feige April 26, May 3, May 10, 2015 1 Linear programming duality 1.1 The diet problem revisited Recall the diet problem from Lecture 1. There are n foods, m nutrients,

More information

Graph coloring, perfect graphs

Graph coloring, perfect graphs Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive

More information

- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs

- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs

More information

Applications of the Inverse Theta Number in Stable Set Problems

Applications of the Inverse Theta Number in Stable Set Problems Acta Cybernetica 21 (2014) 481 494. Applications of the Inverse Theta Number in Stable Set Problems Miklós Ujvári Abstract In the paper we introduce a semidefinite upper bound on the square of the stability

More information

A Review of Linear Programming

A Review of Linear Programming A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex

More information

1 Positive definiteness and semidefiniteness

1 Positive definiteness and semidefiniteness Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +

More information

Semidefinite programs and combinatorial optimization

Semidefinite programs and combinatorial optimization Semidefinite programs and combinatorial optimization Lecture notes by L. Lovász Microsoft Research Redmond, WA 98052 lovasz@microsoft.com http://www.research.microsoft.com/ lovasz Contents 1 Introduction

More information

Lecture #21. c T x Ax b. maximize subject to

Lecture #21. c T x Ax b. maximize subject to COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2 Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2 Instructor: Farid Alizadeh Scribe: Xuan Li 9/17/2001 1 Overview We survey the basic notions of cones and cone-lp and give several

More information

CSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method

CSC 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 information

1 Integer Decomposition Property

1 Integer Decomposition Property CS 598CSC: Combinatorial Optimization Lecture date: Feb 2, 2010 Instructor: Chandra Chekuri Scribe: Siva Theja Maguluri Material taken mostly from [1] (Chapter 19). 1 Integer Decomposition Property A polyhedron

More information

CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi

CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source

More information

Semidefinite Programming Basics and Applications

Semidefinite 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 information

Spring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization

Spring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table

More information

Mustapha Ç. Pinar 1. Communicated by Jean Abadie

Mustapha Ç. 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 information

Approximation Algorithms

Approximation 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 information

CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi

CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest

More information

Copositive Programming and Combinatorial Optimization

Copositive 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 information

BBM402-Lecture 20: LP Duality

BBM402-Lecture 20: LP Duality BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

4. Algebra and Duality

4. Algebra and Duality 4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone

More information

Convex and Semidefinite Programming for Approximation

Convex and Semidefinite Programming for Approximation Convex and Semidefinite Programming for Approximation We have seen linear programming based methods to solve NP-hard problems. One perspective on this is that linear programming is a meta-method since

More information

JOHN THICKSTUN. p x. n sup Ipp y n x np x nq. By the memoryless and stationary conditions respectively, this reduces to just 1 yi x i.

JOHN THICKSTUN. p x. n sup Ipp y n x np x nq. By the memoryless and stationary conditions respectively, this reduces to just 1 yi x i. ESTIMATING THE SHANNON CAPACITY OF A GRAPH JOHN THICKSTUN. channels and graphs Consider a stationary, memoryless channel that maps elements of discrete alphabets X to Y according to a distribution p y

More information

CO 250 Final Exam Guide

CO 250 Final Exam Guide Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,

More information

Lecture 13: Spectral Graph Theory

Lecture 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 information

A 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 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 information

Lecture: Introduction to LP, SDP and SOCP

Lecture: Introduction to LP, SDP and SOCP Lecture: Introduction to LP, SDP and SOCP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2015.html wenzw@pku.edu.cn Acknowledgement:

More information

Lift-and-Project Techniques and SDP Hierarchies

Lift-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 information

Sandwich Theorem and Calculation of the Theta Function for Several Graphs

Sandwich Theorem and Calculation of the Theta Function for Several Graphs Brigham Young University BYU ScholarsArchive All Theses and Dissertations 2003-03-7 Sandwich Theorem and Calculation of the Theta Function for Several Graphs Marcia Ling Riddle Brigham Young University

More information

LNMB PhD Course. Networks and Semidefinite Programming 2012/2013

LNMB PhD Course. Networks and Semidefinite Programming 2012/2013 LNMB PhD Course Networks and Semidefinite Programming 2012/2013 Monique Laurent CWI, Amsterdam, and Tilburg University These notes are based on material developed by M. Laurent and F. Vallentin for the

More information

SDP Relaxations for MAXCUT

SDP 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 information

16.1 L.P. Duality Applied to the Minimax Theorem

16.1 L.P. Duality Applied to the Minimax Theorem CS787: Advanced Algorithms Scribe: David Malec and Xiaoyong Chai Lecturer: Shuchi Chawla Topic: Minimax Theorem and Semi-Definite Programming Date: October 22 2007 In this lecture, we first conclude our

More information

Advanced Combinatorial Optimization September 22, Lecture 4

Advanced Combinatorial Optimization September 22, Lecture 4 8.48 Advanced Combinatorial Optimization September 22, 2009 Lecturer: Michel X. Goemans Lecture 4 Scribe: Yufei Zhao In this lecture, we discuss some results on edge coloring and also introduce the notion

More information

Canonical Problem Forms. Ryan Tibshirani Convex Optimization

Canonical Problem Forms. Ryan Tibshirani Convex Optimization Canonical Problem Forms Ryan Tibshirani Convex Optimization 10-725 Last time: optimization basics Optimization terology (e.g., criterion, constraints, feasible points, solutions) Properties and first-order

More information

Copositive Programming and Combinatorial Optimization

Copositive 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 information

The Simplest Semidefinite Programs are Trivial

The 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 information

Notes 6 : First and second moment methods

Notes 6 : First and second moment methods Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative

More information

Lecture 5 January 16, 2013

Lecture 5 January 16, 2013 UBC CPSC 536N: Sparse Approximations Winter 2013 Prof. Nick Harvey Lecture 5 January 16, 2013 Scribe: Samira Samadi 1 Combinatorial IPs 1.1 Mathematical programs { min c Linear Program (LP): T x s.t. a

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

Lecture 8 : Eigenvalues and Eigenvectors

Lecture 8 : Eigenvalues and Eigenvectors CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with

More information

Acyclic Digraphs arising from Complete Intersections

Acyclic Digraphs arising from Complete Intersections Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine

More information

Strongly Regular Decompositions of the Complete Graph

Strongly Regular Decompositions of the Complete Graph Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl

More information

On the Sandwich Theorem and a approximation algorithm for MAX CUT

On the Sandwich Theorem and a approximation algorithm for MAX CUT On the Sandwich Theorem and a 0.878-approximation algorithm for MAX CUT Kees Roos Technische Universiteit Delft Faculteit Electrotechniek. Wiskunde en Informatica e-mail: C.Roos@its.tudelft.nl URL: http://ssor.twi.tudelft.nl/

More information

Operations Research. Report Applications of the inverse theta number in stable set problems. February 2011

Operations Research. Report Applications of the inverse theta number in stable set problems. February 2011 Operations Research Report 2011-01 Applications of the inverse theta number in stable set problems Miklós Ujvári February 2011 Eötvös Loránd University of Sciences Department of Operations Research Copyright

More information

Section Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010

Section Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010 Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts

More information

Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems

Using 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 information

3. Linear Programming and Polyhedral Combinatorics

3. Linear Programming and Polyhedral Combinatorics Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory

More information

3.7 Cutting plane methods

3.7 Cutting plane methods 3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x

More information

Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone

Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone Monique Laurent 1,2 and Teresa Piovesan 1 1 Centrum Wiskunde & Informatica (CWI), Amsterdam,

More information

Lecture 14: Optimality Conditions for Conic Problems

Lecture 14: Optimality Conditions for Conic Problems EE 227A: Conve Optimization and Applications March 6, 2012 Lecture 14: Optimality Conditions for Conic Problems Lecturer: Laurent El Ghaoui Reading assignment: 5.5 of BV. 14.1 Optimality for Conic Problems

More information

WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES?

WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES? MATHEMATICS OF OPERATIONS RESEARCH Vol. 6, No. 4, November 00, pp. 796 85 Printed in U.S.A. WHEN DOES THE POSITIVE SEMIDEFINITENESS CONSTRAINT HELP IN LIFTING PROCEDURES? MICHEL X. GOEMANS and LEVENT TUNÇEL

More information

1 Strict local optimality in unconstrained optimization

1 Strict local optimality in unconstrained optimization ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s

More information

A notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations

A notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is

More information

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3

MIT 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 information

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Lecture 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 information

Combinatorial Optimization

Combinatorial Optimization Combinatorial Optimization 2017-2018 1 Maximum matching on bipartite graphs Given a graph G = (V, E), find a maximum cardinal matching. 1.1 Direct algorithms Theorem 1.1 (Petersen, 1891) A matching M is

More information

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC

6-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 information

Convex Optimization M2

Convex Optimization M2 Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization

More information

Chapter 1. Preliminaries

Chapter 1. Preliminaries Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between

More information

6.854J / J Advanced Algorithms Fall 2008

6.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 information

LOVÁSZ-SCHRIJVER SDP-OPERATOR AND A SUPERCLASS OF NEAR-PERFECT GRAPHS

LOVÁSZ-SCHRIJVER SDP-OPERATOR AND A SUPERCLASS OF NEAR-PERFECT GRAPHS LOVÁSZ-SCHRIJVER SDP-OPERATOR AND A SUPERCLASS OF NEAR-PERFECT GRAPHS S. BIANCHI, M. ESCALANTE, G. NASINI, L. TUNÇEL Abstract. We study the Lovász-Schrijver SDP-operator applied to the fractional stable

More information

Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)

Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST) Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual

More information

5. Duality. Lagrangian

5. Duality. Lagrangian 5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

Relaxations and Randomized Methods for Nonconvex QCQPs

Relaxations and Randomized Methods for Nonconvex QCQPs Relaxations and Randomized Methods for Nonconvex QCQPs Alexandre d Aspremont, Stephen Boyd EE392o, Stanford University Autumn, 2003 Introduction While some special classes of nonconvex problems can be

More information

Lecture Semidefinite Programming and Graph Partitioning

Lecture Semidefinite Programming and Graph Partitioning Approximation Algorithms and Hardness of Approximation April 16, 013 Lecture 14 Lecturer: Alantha Newman Scribes: Marwa El Halabi 1 Semidefinite Programming and Graph Partitioning In previous lectures,

More information

Duality of LPs and Applications

Duality of LPs and Applications Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will

More information

MIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???

MIT 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 information

A taste of perfect graphs

A taste of perfect graphs A taste of perfect graphs Remark Determining the chromatic number of a graph is a hard problem, in general, and it is even hard to get good lower bounds on χ(g). An obvious lower bound we have seen before

More information

EE 227A: Convex Optimization and Applications October 14, 2008

EE 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 information

IE 5531: Engineering Optimization I

IE 5531: Engineering Optimization I IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1

More information

CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization

CSCI 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 information

Linear and Integer Programming - ideas

Linear and Integer Programming - ideas Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature

More information

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction

More information

Improved 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 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 information

3.8 Strong valid inequalities

3.8 Strong valid inequalities 3.8 Strong valid inequalities By studying the problem structure, we can derive strong valid inequalities which lead to better approximations of the ideal formulation conv(x ) and hence to tighter bounds.

More information

Preliminaries and Complexity Theory

Preliminaries and Complexity Theory Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra

More information

3. Linear Programming and Polyhedral Combinatorics

3. Linear Programming and Polyhedral Combinatorics Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory

More information

ACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms

ACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms 1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex

More information

3.7 Strong valid inequalities for structured ILP problems

3.7 Strong valid inequalities for structured ILP problems 3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 12 Luca Trevisan October 3, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 12 Luca Trevisan October 3, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analysis Handout 1 Luca Trevisan October 3, 017 Scribed by Maxim Rabinovich Lecture 1 In which we begin to prove that the SDP relaxation exactly recovers communities

More information

Multi-coloring and Mycielski s construction

Multi-coloring and Mycielski s construction Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles

More information

Integer Programming ISE 418. Lecture 12. Dr. Ted Ralphs

Integer Programming ISE 418. Lecture 12. Dr. Ted Ralphs Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid

More information

Mathematical Programs Linear Program (LP)

Mathematical Programs Linear Program (LP) Mathematical Programs Linear Program (LP) Integer Program (IP) Can be efficiently solved e.g., by Ellipsoid Method Cannot be efficiently solved Cannot be efficiently solved assuming P NP Combinatorial

More information

Lecture: Examples of LP, SOCP and SDP

Lecture: Examples of LP, SOCP and SDP 1/34 Lecture: Examples of 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 information

Lecture 12 : Graph Laplacians and Cheeger s Inequality

Lecture 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 information

The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs

The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set

More information

3. THE SIMPLEX ALGORITHM

3. THE SIMPLEX ALGORITHM Optimization. THE SIMPLEX ALGORITHM DPK Easter Term. Introduction We know that, if a linear programming problem has a finite optimal solution, it has an optimal solution at a basic feasible solution (b.f.s.).

More information

Topics in Graph Theory

Topics in Graph Theory Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End

More information

Notice that lemma 4 has nothing to do with 3-colorability. To obtain a better result for 3-colorable graphs, we need the following observation.

Notice that lemma 4 has nothing to do with 3-colorability. To obtain a better result for 3-colorable graphs, we need the following observation. COMPSCI 632: Approximation Algorithms November 1, 2017 Lecturer: Debmalya Panigrahi Lecture 18 Scribe: Feng Gui 1 Overview In this lecture, we examine graph coloring algorithms. We first briefly discuss

More information

Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree 3 Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

More information