MIP relaxations in factorable programming
DOI10.1137/22M1515537MaRDI QIDQ6601201FDOQ6601201
Authors: Taotao He, Mohit Tawarmalani 
Publication date: 10 September 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
mixed-integer nonlinear programmingconvexificationincremental formulationmixed-integer programming relaxationrelaxation propagation
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
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Triangulations. Structures for algorithms and applications
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Convex extensions and envelopes of lower semi-continuous functions
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Disjunctive programming: Properties of the convex hull of feasible points
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Modelling with integer variables
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Compact mixed-integer programming formulations in quadratic optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Computable representations for convex hulls of low-dimensional quadratic forms
- Using Piecewise Linear Functions for Solving MINLPs
- On convex relaxations of quadrilinear terms
- Solving mixed integer bilinear problems using MILP formulations
- Extended formulations for convex hulls of some bilinear functions
- Recognition problems for special classes of polynomials in 0-1 variables
- Incremental and encoding formulations for mixed integer programming
- Mixed integer linear programming formulation techniques
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Short proofs on the matching polyhedron
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
- A new framework to relax composite functions in nonlinear programs
- Tractable Relaxations of Composite Functions
Cited In (1)
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)
