MIP relaxations in factorable programming

DOI10.1137/22M1515537MaRDI QIDQ6601201zbMATH OpenFDO

Authors Taotao He, Mohit Tawarmalani

Publication date 10 September 2024

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/22M1515537

zbMATH Keywords

convexificationincremental formulationmixed-integer nonlinear programmingmixed-integer programming relaxationrelaxation propagation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A combinatorial approach for small and strong formulations of disjunctive constraints
• A convex envelope formula for multilinear functions
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A new framework to relax composite functions in nonlinear programs
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Branching and bounds tighteningtechniques for non-convex MINLP
• Compact mixed-integer programming formulations in quadratic optimization
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Computable representations for convex hulls of low-dimensional quadratic forms
• Convex envelopes generated from finitely many compact convex sets
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• Convex extensions and envelopes of lower semi-continuous functions
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Disjunctive programming: Properties of the convex hull of feasible points
• Explicit convex and concave envelopes through polyhedral subdivisions
• Extended formulations for convex hulls of some bilinear functions
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• Incremental and encoding formulations for mixed integer programming
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Mixed integer linear programming formulation techniques
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Modelling with integer variables
• On convex relaxations of quadrilinear terms
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Recognition problems for special classes of polynomials in 0-1 variables
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Short proofs on the matching polyhedron
• Solving mixed integer bilinear problems using MILP formulations
• Tractable relaxations of composite functions
• Triangulations. Structures for algorithms and applications
• Using Piecewise Linear Functions for Solving MINLPs

Cited in

(1)

• Piecewise polyhedral relaxations of multilinear optimization

This page was built for publication: MIP relaxations in factorable programming

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