TY - JOUR

T1 - Quadratic reformulations of nonlinear binary optimization problems

AU - Anthony, Martin

AU - Boros, Endre

AU - Crama, Yves

AU - Gruber, Aritanan

N1 - Funding Information:
We are grateful to Zolt??n Szigeti and Gy??rgy Tur??n for pointers on 2-bases and on representations of symmetric functions, and to the reviewers for their valuable comments. The second author thanks the National Science Foundation (Grant IIS-1161476) for partial support. The third author was partially funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office (Grant P7/36) and by a sabbatical grant from FNRS. The fourth author thanks the joint CAPES (Brazil)/Fulbright (USA) fellowship process BEX-2387050/15061676 and the S??o Paulo Science Foundation (FAPESP) process 2014/23269-8 for partial support.
Publisher Copyright:
© 2016, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.

PY - 2017/3/1

Y1 - 2017/3/1

N2 - Very large nonlinear unconstrained binary optimization problems arise in a broad array of applications. Several exact or heuristic techniques have proved quite successful for solving many of these problems when the objective function is a quadratic polynomial. However, no similarly efficient methods are available for the higher degree case. Since high degree objectives are becoming increasingly important in certain application areas, such as computer vision, various techniques have been recently developed to reduce the general case to the quadratic one, at the cost of increasing the number of variables by introducing additional auxiliary variables. In this paper we initiate a systematic study of these quadratization approaches. We provide tight lower and upper bounds on the number of auxiliary variables needed in the worst-case for general objective functions, for bounded-degree functions, and for a restricted class of quadratizations. Our upper bounds are constructive, thus yielding new quadratization procedures. Finally, we completely characterize all “minimal” quadratizations of negative monomials.

AB - Very large nonlinear unconstrained binary optimization problems arise in a broad array of applications. Several exact or heuristic techniques have proved quite successful for solving many of these problems when the objective function is a quadratic polynomial. However, no similarly efficient methods are available for the higher degree case. Since high degree objectives are becoming increasingly important in certain application areas, such as computer vision, various techniques have been recently developed to reduce the general case to the quadratic one, at the cost of increasing the number of variables by introducing additional auxiliary variables. In this paper we initiate a systematic study of these quadratization approaches. We provide tight lower and upper bounds on the number of auxiliary variables needed in the worst-case for general objective functions, for bounded-degree functions, and for a restricted class of quadratizations. Our upper bounds are constructive, thus yielding new quadratization procedures. Finally, we completely characterize all “minimal” quadratizations of negative monomials.

KW - Nonlinear binary optimization

KW - Pseudo-Boolean functions

KW - Quadratic binary optimization

KW - Reformulation methods

UR - http://www.scopus.com/inward/record.url?scp=84973103255&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84973103255&partnerID=8YFLogxK

U2 - 10.1007/s10107-016-1032-4

DO - 10.1007/s10107-016-1032-4

M3 - Article

AN - SCOPUS:84973103255

VL - 162

SP - 115

EP - 144

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-2

ER -