Convex Hull Formulations for Mixed-Integer Multilinear Functions

07/29/2018
by   Harsha Nagarajan, et al.
0

In this paper, we present convex hull formulations for a mixed-integer, multilinear term/function (MIMF) that features products of multiple continuous and binary variables. We develop two equivalent convex relaxations of an MIMF and study their polyhedral properties in their corresponding higher-dimensional spaces. We numerically observe that the proposed formulations consistently perform better than state-of-the-art relaxation approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2020

Piecewise Polyhedral Formulations for a Multilinear Term

In this paper, we present a mixed-integer linear programming formulation...
research
02/08/2021

Partition-based formulations for mixed-integer optimization of trained ReLU neural networks

This paper introduces a class of mixed-integer formulations for trained ...
research
09/15/2020

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions

We study MINLO (mixed-integer nonlinear optimization) formulations of th...
research
02/28/2023

Tightness of prescriptive tree-based mixed-integer optimization formulations

We focus on modeling the relationship between an input feature vector an...
research
06/11/2018

The CCP Selector: Scalable Algorithms for Sparse Ridge Regression from Chance-Constrained Programming

Sparse regression and variable selection for large-scale data have been ...
research
07/12/2023

Outlier detection in regression: conic quadratic formulations

In many applications, when building linear regression models, it is impo...
research
09/26/2013

Convex Relaxations of Bregman Divergence Clustering

Although many convex relaxations of clustering have been proposed in the...

Please sign up or login with your details

Forgot password? Click here to reset