Cardinality Constrained Multilinear Sets

The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set, and many valid inequalities for its convex hull are available in the literature. Motivated by a machine learning application, we study a cardinality constrained version of this problem with upper and lower bounds on the number of nonzero variables. We call the set of solutions of the standard linearization of this problem a cardinality constrained multilinear set, and give a complete polyhedral description of its convex hull when the multilinear terms in the problem have a nested structure.

[1]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[2]  Yves Crama,et al.  A class of valid inequalities for multilinear 0-1 optimization problems , 2017, Discret. Optim..

[3]  Noam Goldberg,et al.  OPTIMIZATION FOR SPARSE AND ACCURATE CLASSIFIERS , 2010 .

[4]  Sanjeeb Dash,et al.  Boolean Decision Rules via Column Generation , 2018, NeurIPS.

[5]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[6]  Alberto Del Pia,et al.  On decomposability of Multilinear sets , 2018, Math. Program..

[7]  Nikolaos V. Sahinidis,et al.  On the impact of running intersection inequalities for globally solving polynomial optimization problems , 2020, Math. Program. Comput..

[8]  S. Thomas McCormick,et al.  Matroid optimisation problems with nested non-linear monomials in the objective function , 2018, Math. Program..

[9]  Jonathan Eckstein,et al.  REPR: Rule-Enhanced Penalized Regression , 2019, INFORMS Journal on Optimization.

[10]  Noam Goldberg,et al.  An Improved Branch-and-Bound Method for Maximum Monomial Agreement , 2012, INFORMS J. Comput..

[11]  Alberto Del Pia,et al.  A Polyhedral Study of Binary Polynomial Programs , 2017, Math. Oper. Res..

[12]  Christoph Buchheim,et al.  Combinatorial optimization with one quadratic term: Spanning trees and forests , 2014, Discret. Appl. Math..

[13]  Noam Goldberg,et al.  Boosting Classifiers with Tightened L0-Relaxation Penalties , 2010, ICML.

[14]  S. Thomas McCormick,et al.  Matroid optimization problems with monotone monomials in the objective , 2020 .

[15]  Ayhan Demiriz,et al.  Linear Programming Boosting via Column Generation , 2002, Machine Learning.

[16]  Dimitrios Gunopulos,et al.  Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning , 1996, J. Comput. Syst. Sci..

[17]  Alberto Del Pia,et al.  The Multilinear Polytope for Acyclic Hypergraphs , 2018, SIAM J. Optim..

[18]  Anuj Mehrotra.  Cardinality Constrained Boolean Quadratic Polytope , 1997, Discret. Appl. Math..

[19]  Anja Fischer,et al.  Complete description for the spanning tree problem with one linearised quadratic term , 2013, Oper. Res. Lett..