Between steps: intermediate relaxations between big-M and convex hull formulations

DOI10.1007/978-3-030-78230-6_19OpenAlexW3177301368MaRDI QIDQ2117230FDOQ2117230

Calvin Tsay, Ruth Misener, Jan Kronqvist

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2101.12708

zbMATH Keywords

mixed-integer programmingdisjunctive programmingformulationsconvex MINLPrelaxation comparison

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Disjunctive programming: Properties of the convex hull of feasible points
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Modelling with integer variables
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• On mathematical programming with indicator constraints
• Title not available (Why is that?)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Mixed-integer nonlinear programs featuring ``on/off constraints
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• On the convex hull of the union of certain polyhedra
• A simplification for some disjunctive formulations
• Solving mixed integer classification problems by decomposition
• Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
• Integer Programming
• Integer Programming Solution of a Classification Problem
• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• Mixed integer linear programming formulation techniques
• Compact formulations as a union of polyhedra
• Lossless compression of deep neural networks
• Deep neural networks and mixed integer linear optimization
• Strong mixed-integer programming formulations for trained neural networks
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
• Disjunctive Programming
• Small and strong formulations for unions of convex sets from the Cayley embedding

Cited In (3)

• Optimization of sparsity-constrained neural networks as a mixed integer linear program
• Between steps: Intermediate relaxations between big-M and convex hull formulations
• Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization

Uses Software

• MNIST
• PyTorch

This page was built for publication: Between steps: intermediate relaxations between big-M and convex hull formulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117230)