A notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
|
|
- Scott Welch
- 5 years ago
- Views:
Transcription
1 A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018
2 A vector in R n is integral if each of its components is an integer,
3 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI)
4 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI) if, for every integral vector c Z n, the LP problem dual to sup { c, x : Ax b} has an integral optimal solution whenever it has an optimal solution at all.
5 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI) if, for every integral vector c Z n, the LP problem dual to sup { c, x : Ax b} has an integral optimal solution whenever it has an optimal solution at all. In this case, the polyhedron P determined by Ax b is integral, i.e., each nonempty face of P has an integral vector;
6 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI) if, for every integral vector c Z n, the LP problem dual to sup { c, x : Ax b} has an integral optimal solution whenever it has an optimal solution at all. In this case, the polyhedron P determined by Ax b is integral, i.e., each nonempty face of P has an integral vector; thus, (under the assumption that both primal and dual are feasible)
7 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI) if, for every integral vector c Z n, the LP problem dual to sup { c, x : Ax b} has an integral optimal solution whenever it has an optimal solution at all. In this case, the polyhedron P determined by Ax b is integral, i.e., each nonempty face of P has an integral vector; thus, (under the assumption that both primal and dual are feasible) equality holds throughout in the chain from the board.
8 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI) if, for every integral vector c Z n, the LP problem dual to sup { c, x : Ax b} has an integral optimal solution whenever it has an optimal solution at all. In this case, the polyhedron P determined by Ax b is integral, i.e., each nonempty face of P has an integral vector; thus, (under the assumption that both primal and dual are feasible) equality holds throughout in the chain from the board. This was proved in seminal work of Edmonds and Giles [1977] as a consequence of the following fundamental result:
9 A vector in R n is integral if each of its components is an integer, and a rational system of linear inequalities Ax b is called totally dual integral (TDI) if, for every integral vector c Z n, the LP problem dual to sup { c, x : Ax b} has an integral optimal solution whenever it has an optimal solution at all. In this case, the polyhedron P determined by Ax b is integral, i.e., each nonempty face of P has an integral vector; thus, (under the assumption that both primal and dual are feasible) equality holds throughout in the chain from the board. This was proved in seminal work of Edmonds and Giles [1977] as a consequence of the following fundamental result: Theorem (Edmonds-Giles [1977]) If A Q m n and b Q m satisfy sup { c, x : Ax b} Z {± } for each c Z n, then the polyhedron {x R n : Ax b} is integral.
10 (Edmonds and Giles [1977]) If A Q m n and b Q m satisfy sup { c, x : Ax b} Z {± } for each c Z n, then the polyhedron {x R n : Ax b} is integral.
11 (Edmonds and Giles [1977]) If A Q m n and b Q m satisfy sup { c, x : Ax b} Z {± } for each c Z n, then the polyhedron {x R n : Ax b} is integral. Corollary (Hoffman [1974]) Let A Q m n and b Q m. If P := {x R n : Ax b} is bounded and max x P c, x Z for each c Z n, then P is integral.
12 To define the integrality constraint for the dual SDP, we shall consider the dual slack.
13 To define the integrality constraint for the dual SDP, we shall consider the dual slack. Definition Let S be feasible in the dual SDP. We say that S is integral if S is a sum N S = k=1 S k of rank-one matrices S 1,..., S N S n+1 + k [N], we have such that, for each (S k ) 00 = 1, (S k ) 0j + (S k ) jj = 0 j [n].
14 If C R n is a compact convex set, then C = {x R n : w, x δ (C w) w Z n }.
15 If C R n is a compact convex set, then C = {x R n : w, x δ (C w) w Z n }. Let C I := conv (C Z n ).
16 If C R n is a compact convex set, then C = {x R n : w, x δ (C w) w Z n }. Let C I := conv (C Z n ). Using a bit more from IP theory, we conclude the following generalization of Hoffman s Theorem.
17 If C R n is a compact convex set, then C = {x R n : w, x δ (C w) w Z n }. Let C I := conv (C Z n ). Using a bit more from IP theory, we conclude the following generalization of Hoffman s Theorem. Corollary If C R n is a nonempty compact convex set, then C = C I if and only if δ (C w) Z for every w Z n.
18 Let C R n be a nonempty compact convex set. Then, TFAE
19 Let C R n be a nonempty compact convex set. Then, TFAE (i) C = C I ;
20 Let C R n be a nonempty compact convex set. Then, TFAE (i) C = C I ; (ii) every nonempty face of C contains an integral point;
21 Let C R n be a nonempty compact convex set. Then, TFAE (i) C = C I ; (ii) every nonempty face of C contains an integral point; (iii) for every w R n, max{ w, x : x C} is attained by an integral vector;
22 Let C R n be a nonempty compact convex set. Then, TFAE (i) C = C I ; (ii) every nonempty face of C contains an integral point; (iii) for every w R n, max{ w, x : x C} is attained by an integral vector; (iv) every rational supporting hyperplane for C contains integral points;
23 Let C R n be a nonempty compact convex set. Then, TFAE (i) C = C I ; (ii) every nonempty face of C contains an integral point; (iii) for every w R n, max{ w, x : x C} is attained by an integral vector; (iv) every rational supporting hyperplane for C contains integral points; (v) x C such that for each w Z n, { } 1 w, x + inf η R ++ : w (C x)o η Z.
24 Definition Let L : R k S n+1 be a linear map. The system A( ˆX ) b, ˆX 0 is TDI through L
25 Definition Let L : R k S n+1 be a linear map. The system A( ˆX ) b, ˆX 0 is TDI through L if for every c Z k, the SDP dual to { } sup L(c), ˆX : A( ˆX ) b ˆX 0 has an integral optimal solution, whenever it has an optimal solution.
26 Definition Let L : R k S n+1 be a linear map. The system A( ˆX ) b, ˆX 0 is TDI through L if for every c Z k, the SDP dual to { } sup L(c), ˆX : A( ˆX ) b ˆX 0 has an integral optimal solution, whenever it has an optimal solution. Note, ˆX is of the form [ ] 1 x x X
27 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1.
28 Let A( ˆX ) b, ˆX 0 be { TDI through a linear map} L: R k S n+1. Set Ĉ := ˆX S n+1 + : A( ˆX ) b and C := L (Ĉ) R k.
29 Let A( ˆX ) b, ˆX 0 be { TDI through a linear map} L: R k S n+1. Set Ĉ := ˆX S n+1 + : A( ˆX ) b and C := L (Ĉ) R k. If b is integral, C is compact, and Ĉ has a positive definite matrix,
30 Let A( ˆX ) b, ˆX 0 be { TDI through a linear map} L: R k S n+1. Set Ĉ := ˆX S n+1 + : A( ˆX ) b and C := L (Ĉ) R k. If b is integral, C is compact, and Ĉ has a positive definite matrix, then C = C I.
31 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that b is integral.
32 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that { b is integral. Suppose } that Ĉ := ˆX S n+1 + : A( ˆX ) b has a positive definite matrix
33 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that { b is integral. Suppose } that Ĉ := ˆX S n+1 + : A( ˆX ) b has a positive definite matrix and that C := L (Ĉ) [0, 1] k is compact.
34 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that { b is integral. Suppose } that Ĉ := ˆX S n+1 + : A( ˆX ) b has a positive definite matrix and that C := L (Ĉ) [0, 1] k is compact. If Ĉ is a rank-one embedding of C I via L,
35 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that { b is integral. Suppose } that Ĉ := ˆX S n+1 + : A( ˆX ) b has a positive definite matrix and that C := L (Ĉ) [0, 1] k is compact. If Ĉ is a rank-one embedding of C I via L, then for every w Z k, equality holds throughout in the chain of inequalities on the board,
36 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that { b is integral. Suppose } that Ĉ := ˆX S n+1 + : A( ˆX ) b has a positive definite matrix and that C := L (Ĉ) [0, 1] k is compact. If Ĉ is a rank-one embedding of C I via L, then for every w Z k, equality holds throughout in the chain of inequalities on the board, all optimum values are equal to max { w, x : x C I },
37 Let A( ˆX ) b, ˆX 0 be TDI through a linear map L: R k S n+1 such that { b is integral. Suppose } that Ĉ := ˆX S n+1 + : A( ˆX ) b has a positive definite matrix and that C := L (Ĉ) [0, 1] k is compact. If Ĉ is a rank-one embedding of C I via L, then for every w Z k, equality holds throughout in the chain of inequalities on the board, all optimum values are equal to max { w, x : x C I }, and all suprema and infima are attained.
38 Open Problems/research Directions Obtain a primal-dual symmetric integrality condition for SDPs that applies to arbitrary ILPs, not just binary ones.
39 Open Problems/research Directions Obtain a primal-dual symmetric integrality condition for SDPs that applies to arbitrary ILPs, not just binary ones. Given k 1 and the LS + operator of Lovász and Schrijver [1991](called N + in their paper), determine the class of graphs for which the kth iterate of the LS + operator applied to the system x 0, x i + x j 1 ij E yields a TDI system through the appropriate lifting, leading to a family of combinatorial min-max theorems involving maximum weight stable sets in such graphs.
40 Open Problems/research Directions Obtain a primal-dual symmetric integrality condition for SDPs that applies to arbitrary ILPs, not just binary ones. Given k 1 and the LS + operator of Lovász and Schrijver [1991](called N + in their paper), determine the class of graphs for which the kth iterate of the LS + operator applied to the system x 0, x i + x j 1 ij E yields a TDI system through the appropriate lifting, leading to a family of combinatorial min-max theorems involving maximum weight stable sets in such graphs. Obtain systematic, primal-dual symmetric conditions for exactness in SDP relaxations for continuous problems.
41 Every pointed closed convex set is the intersection of all closed rational halfspaces containing it.
42 Every pointed closed convex set is the intersection of all closed rational halfspaces containing it. This presentation was based on: M. K. de Carli Silva and L. T., A notion of total dual integrality for convex, semidefinite, and extended formulations, arxiv: M. K. de Carli Silva and L. T., Pointed closed convex sets are the intersection of all rational supporting closed halfspaces, arxiv:
- 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 information1 Review of last lecture and introduction
Semidefinite Programming Lecture 10 OR 637 Spring 2008 April 16, 2008 (Wednesday) Instructor: Michael Jeremy Todd Scribe: Yogeshwer (Yogi) Sharma 1 Review of last lecture and introduction Let us first
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
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 informationLinear and Combinatorial Optimization
Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
More informationAdditional Homework Problems
Additional Homework Problems Robert M. Freund April, 2004 2004 Massachusetts Institute of Technology. 1 2 1 Exercises 1. Let IR n + denote the nonnegative orthant, namely IR + n = {x IR n x j ( ) 0,j =1,...,n}.
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 informationChapter 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 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 informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 4 Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 2 4.1. Subgradients definition subgradient calculus duality and optimality conditions Shiqian
More informationLinear Programming. Scheduling problems
Linear Programming Scheduling problems Linear programming (LP) ( )., 1, for 0 min 1 1 1 1 1 11 1 1 n i x b x a x a b x a x a x c x c x z i m n mn m n n n n! = + + + + + + = Extreme points x ={x 1,,x n
More informationOn the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs Yogesh Awate Tepper School of Business, Carnegie Mellon University, Pittsburgh,
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationLecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Handout 1 18.433: Combinatorial Optimization May 14th, 007 Michel X. Goemans Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm
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 informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
More informationConvex 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 informationCuts for mixed 0-1 conic programs
Cuts for mixed 0-1 conic programs G. Iyengar 1 M. T. Cezik 2 1 IEOR Department Columbia University, New York. 2 GERAD Université de Montréal, Montréal TU-Chemnitz Workshop on Integer Programming and Continuous
More informationconstraints Ax+Gy» b (thus any valid inequalityforp is of the form u(ax+gy)» ub for u 2 R m + ). In [13], Gomory introduced a family of valid inequali
On the Rank of Mixed 0,1 Polyhedra Λ Gérard Cornuéjols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA (corresponding author: gc0v@andrew.cmu.edu) February
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More information3.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 information14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness.
CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 14. Duality ˆ Upper and lower bounds ˆ General duality ˆ Constraint qualifications ˆ Counterexample ˆ Complementary slackness ˆ Examples ˆ Sensitivity
More information3. 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 informationLecture 1: Background on Convex Analysis
Lecture 1: Background on Convex Analysis John Duchi PCMI 2016 Outline I Convex sets 1.1 Definitions and examples 2.2 Basic properties 3.3 Projections onto convex sets 4.4 Separating and supporting hyperplanes
More informationI.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010
I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0
More informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More informationLinear and non-linear programming
Linear and non-linear programming Benjamin Recht March 11, 2005 The Gameplan Constrained Optimization Convexity Duality Applications/Taxonomy 1 Constrained Optimization minimize f(x) subject to g j (x)
More informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More information4. 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 informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationarxiv:math/ v1 [math.co] 23 May 2000
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems arxiv:math/0005229v1 [math.co] 23 May 2000 Masakazu Kojima Department of Mathematical and Computing Sciences
More informationc 2000 Society for Industrial and Applied Mathematics
SIAM J. OPIM. Vol. 10, No. 3, pp. 750 778 c 2000 Society for Industrial and Applied Mathematics CONES OF MARICES AND SUCCESSIVE CONVEX RELAXAIONS OF NONCONVEX SES MASAKAZU KOJIMA AND LEVEN UNÇEL Abstract.
More informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
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 informationVERTICES OF SPECTRAHEDRA ARISING FROM THE ELLIPTOPE, THE THETA BODY, AND THEIR RELATIVES
VERTICES OF SPECTRAHEDRA ARISING FROM THE ELLIPTOPE, THE THETA BODY, AND THEIR RELATIVES MARCEL K. DE CARLI SILVA AND LEVENT TUNÇEL Abstract. Utilizing dual descriptions of the normal cone of convex optimization
More informationGeometric Ramifications of the Lovász Theta Function and Their Interplay with Duality
Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality by Marcel Kenji de Carli Silva A thesis presented to the University of Waterloo in fulfillment of the thesis requirement
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
More informationInteger Programming ISE 418. Lecture 16. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 16 Dr. Ted Ralphs ISE 418 Lecture 16 1 Reading for This Lecture Wolsey, Chapters 10 and 11 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.3.7, II.5.4 CCZ Chapter 8
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More informationLECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE
LECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE CONVEX ANALYSIS AND DUALITY Basic concepts of convex analysis Basic concepts of convex optimization Geometric duality framework - MC/MC Constrained optimization
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 informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationWeek 8. 1 LP is easy: the Ellipsoid Method
Week 8 1 LP is easy: the Ellipsoid Method In 1979 Khachyan proved that LP is solvable in polynomial time by a method of shrinking ellipsoids. The running time is polynomial in the number of variables n,
More informationSeparation Techniques for Constrained Nonlinear 0 1 Programming
Separation Techniques for Constrained Nonlinear 0 1 Programming Christoph Buchheim Computer Science Department, University of Cologne and DEIS, University of Bologna MIP 2008, Columbia University, New
More informationOn the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs Yogesh Awate Tepper School of Business, Carnegie Mellon University, Pittsburgh,
More informationU.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 informationWHEN 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 information9. Interpretations, Lifting, SOS and Moments
9-1 Interpretations, Lifting, SOS and Moments P. Parrilo and S. Lall, CDC 2003 2003.12.07.04 9. Interpretations, Lifting, SOS and Moments Polynomial nonnegativity Sum of squares (SOS) decomposition Eample
More informationA 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 informationInteger 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 informationEE364a Review Session 5
EE364a Review Session 5 EE364a Review announcements: homeworks 1 and 2 graded homework 4 solutions (check solution to additional problem 1) scpd phone-in office hours: tuesdays 6-7pm (650-723-1156) 1 Complementary
More informationSemidefinite Programming
Chapter 2 Semidefinite Programming 2.0.1 Semi-definite programming (SDP) Given C M n, A i M n, i = 1, 2,..., m, and b R m, the semi-definite programming problem is to find a matrix X M n for the optimization
More informationConic Linear Optimization and its Dual. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #04 1 Conic Linear Optimization and its Dual Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
More informationSuccessive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems Akiko TAKEDA Submitted in partial fulfillments of the requirement for the degree of DOCTOR OF SCIENCE Department of Mathematical
More informationLP. Kap. 17: Interior-point methods
LP. Kap. 17: Interior-point methods the simplex algorithm moves along the boundary of the polyhedron P of feasible solutions an alternative is interior-point methods they find a path in the interior of
More informationMixed-integer linear representability, disjunctions, and variable elimination
Mixed-integer linear representability, disjunctions, and variable elimination Amitabh Basu Kipp Martin Christopher Thomas Ryan Guanyi Wang December 19, 2016 Abstract Jeroslow and Lowe gave an exact geometric
More information3. 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 informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationSummer School: Semidefinite Optimization
Summer School: Semidefinite Optimization Christine Bachoc Université Bordeaux I, IMB Research Training Group Experimental and Constructive Algebra Haus Karrenberg, Sept. 3 - Sept. 7, 2012 Duality Theory
More informationThe Ellipsoid Algorithm
The Ellipsoid Algorithm John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA 9 February 2018 Mitchell The Ellipsoid Algorithm 1 / 28 Introduction Outline 1 Introduction 2 Assumptions
More information5. 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 informationLecture: 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 informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationCO 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 informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationLecture 2: The Simplex method
Lecture 2 1 Linear and Combinatorial Optimization Lecture 2: The Simplex method Basic solution. The Simplex method (standardform, b>0). 1. Repetition of basic solution. 2. One step in the Simplex algorithm.
More informationLectures 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 informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationPart IB Optimisation
Part IB Optimisation Theorems Based on lectures by F. A. Fischer Notes taken by Dexter Chua Easter 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationLecture: Cone programming. Approximating the Lorentz cone.
Strong relaxations for discrete optimization problems 10/05/16 Lecture: Cone programming. Approximating the Lorentz cone. Lecturer: Yuri Faenza Scribes: Igor Malinović 1 Introduction Cone programming is
More informationConvex Optimization M2
Convex Optimization M2 Lecture 8 A. d Aspremont. Convex Optimization M2. 1/57 Applications A. d Aspremont. Convex Optimization M2. 2/57 Outline Geometrical problems Approximation problems Combinatorial
More informationLecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem
Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem Michael Patriksson 0-0 The Relaxation Theorem 1 Problem: find f := infimum f(x), x subject to x S, (1a) (1b) where f : R n R
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 informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
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 informationarxiv: v15 [math.oc] 19 Oct 2016
LP formulations for mixed-integer polynomial optimization problems Daniel Bienstock and Gonzalo Muñoz, Columbia University, December 2014 arxiv:1501.00288v15 [math.oc] 19 Oct 2016 Abstract We present a
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationSubgradient. Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes. definition. subgradient calculus
1/41 Subgradient Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes definition subgradient calculus duality and optimality conditions directional derivative Basic inequality
More informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More informationMinimal inequalities for an infinite relaxation of integer programs
Minimal inequalities for an infinite relaxation of integer programs Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols
More informationSpring 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 informationLagrange Relaxation and Duality
Lagrange Relaxation and Duality As we have already known, constrained optimization problems are harder to solve than unconstrained problems. By relaxation we can solve a more difficult problem by a simpler
More informationThe Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006
The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,
More informationOPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM
OPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM Abstract These notes give a summary of the essential ideas and results It is not a complete account; see Winston Chapters 4, 5 and 6 The conventions and notation
More informationProblem 1 (Exercise 2.2, Monograph)
MS&E 314/CME 336 Assignment 2 Conic Linear Programming January 3, 215 Prof. Yinyu Ye 6 Pages ASSIGNMENT 2 SOLUTIONS Problem 1 (Exercise 2.2, Monograph) We prove the part ii) of Theorem 2.1 (Farkas Lemma
More informationInterior Point Algorithms for Constrained Convex Optimization
Interior Point Algorithms for Constrained Convex Optimization Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Inequality constrained minimization problems
More informationLecture 8 Plus properties, merit functions and gap functions. September 28, 2008
Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:
More informationZero sum games Proving the vn theorem. Zero sum games. Roberto Lucchetti. Politecnico di Milano
Politecnico di Milano General form Definition A two player zero sum game in strategic form is the triplet (X, Y, f : X Y R) f (x, y) is what Pl1 gets from Pl2, when they play x, y respectively. Thus g
More informationSeparation, Inverse Optimization, and Decomposition. Some Observations. Ted Ralphs 1 Joint work with: Aykut Bulut 1
: Some Observations Ted Ralphs 1 Joint work with: Aykut Bulut 1 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University MOA 2016, Beijing, China, 27 June 2016 What Is This Talk
More informationLecture #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 informationSemidefinite 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 informationOn the matrix-cut rank of polyhedra
On the matrix-cut rank of polyhedra William Cook and Sanjeeb Dash Computational and Applied Mathematics Rice University August 5, 00 Abstract Lovász and Schrijver (99) described a semi-definite operator
More information{ move v ars to left, consts to right { replace = by t wo and constraints Ax b often nicer for theory Ax = b good for implementations. { A invertible
Finish remarks on min-cost ow. Strongly polynomial algorithms exist. { Tardos 1985 { minimum mean-cost cycle { reducing -optimality { \xing" arcs of very high reduced cost { best running running time roughly
More informationApplications of semidefinite programming in Algebraic Combinatorics
Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011 We often want to 1 Bound the value of a numerical parameter of certain combinatorial
More informationLift-and-Project Techniques and SDP Hierarchies
MFO seminar on Semidefinite Programming May 30, 2010 Typical combinatorial optimization problem: max c T x s.t. Ax b, x {0, 1} n P := {x R n Ax b} P I := conv(k {0, 1} n ) LP relaxation Integral polytope
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More information