Cuts for Conic Mixed-Integer Programming

A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructures of second-order conic sets. These cuts can be readily incorporated in branch-and-bound algorithms that solve continuous conic programming relaxations at the nodes of the search tree. Our preliminary computational experiments with the new cuts show that they are quite effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs.

[1]  Masakazu Kojima,et al.  Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint , 2003, Optim. Methods Softw..

[2]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[3]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[4]  Masakazu Kojima,et al.  Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) , 2003, Optim. Methods Softw..

[5]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[6]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[7]  Sanjay Mehrotra,et al.  A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[10]  Hanif D. Sherali,et al.  Optimization with disjunctive constraints , 1980 .

[11]  A. S. Nemirovsky,et al.  Conic formulation of a convex programming problem and duality , 1992 .

[12]  Hanif D. Sherali,et al.  A reformulation-convexification approach for solving nonconvex quadratic programming problems , 1995, J. Glob. Optim..

[13]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[14]  Mehmet Tolga Çezik,et al.  Cuts for mixed 0-1 conic programming , 2005, Math. Program..

[15]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[16]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[17]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[18]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[19]  Jeff T. Linderoth.  A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs , 2005, Math. Program..

[20]  S. J. Benson,et al.  DSDP5 user guide - software for semidefinite programming. , 2006 .

[21]  Yinyu Ye,et al.  DSDP5: Software for Semidefinite Programming , 2005 .

[22]  Masakazu Kojima,et al.  Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets , 1999, SIAM J. Optim..

[23]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[24]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[25]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[26]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[27]  Michel X. Goemans,et al.  Semideenite Programming in Combinatorial Optimization , 1999 .

[28]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[29]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .

[30]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[31]  Alper Atamtürk,et al.  Sequence Independent Lifting for Mixed-Integer Programming , 2004, Oper. Res..

[32]  B. Borchers.  CSDP, A C library for semidefinite programming , 1999 .