Conic mixed-integer rounding cuts

A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constraints. We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second-order conic sets. These cuts can be readily incorporated in branch-and-bound algorithms that solve either second-order conic programming or linear programming relaxations of conic integer programs at the nodes of the branch-and-bound tree. Central to our approach is a reformulation of the second-order conic constraints with polyhedral second-order conic constraints in a higher dimensional space. In this representation the cuts we develop are linear, even though they are nonlinear in the original space of variables. This feature leads to a computationally efficient implementation of nonlinear cuts for conic mixed-integer programming. The reformulation also allows the use of polyhedral methods for conic integer programming. We report computational results on solving unstructured second-order conic mixed-integer problems as well as mean–variance capital budgeting problems and least-squares estimation problems with binary inputs. Our computational experiments show that conic mixed-integer rounding cuts are very effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs and, hence, improving their solvability.

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

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

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

[4]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

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

[6]  Richard D. McBride,et al.  Finding the Integer Efficient Frontier for Quadratic Capital Budgeting Problems , 1981, Journal of Financial and Quantitative Analysis.

[7]  Sanjay Mehrotra,et al.  Generating Convex Polynomial Inequalities for Mixed 0–1 Programs , 2002, J. Glob. Optim..

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

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

[10]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[11]  Zhi-Quan Luo,et al.  Applications of convex optimization in signal processing and digital communication , 2003, Math. Program..

[12]  Leon G. Higley,et al.  Forensic Entomology: An Introduction , 2009 .

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

[14]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

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

[16]  O. SIAMJ..  CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS , 2000 .

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

[18]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

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

[20]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

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

[22]  James V. Jucker,et al.  Some Problems in Applying the Continuous Portfolio Selection Model to the Discrete Capital Budgeting Problem , 1978, Journal of Financial and Quantitative Analysis.

[23]  Michel X. Goemans,et al.  Semidefinite programming in combinatorial optimization , 1997, Math. Program..

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

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

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

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

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

[29]  M. Goemans.  Semidefinite programming in combinatorial optimization 1 , 1997 .

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

[31]  Jeff T. Linderoth,et al.  FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .

[32]  George L. Nemhauser,et al.  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..

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

[34]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[35]  Amir K. Khandani,et al.  A near maximum likelihood decoding algorithm for MIMO systems based on semi-definite programming , 2005, ISIT.

[36]  Zhi-Quan Luo,et al.  On blind source separation using mutual information criterion , 2003, Math. Program..

[37]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

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

[39]  Egon Balas.  Disjunctive Programming , 2010, 50 Years of Integer Programming.

[40]  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..

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

[42]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[43]  Krishna R. Pattipati,et al.  Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound , 2004, IEEE Transactions on Communications.

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

[45]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[46]  Alper Atamtürk,et al.  Lifting for conic mixed-integer programming , 2011, Math. Program..

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

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

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

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

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