Piecewise polyhedral relaxations of multilinear optimization

DOI10.1137/22M1507486MaRDI QIDQ6622747zbMATH OpenFDO

Authors Jong-Eun Kim, Jean-Philippe Richard, Mohit Tawarmalani

Publication date 22 October 2024

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

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

zbMATH Keywords

multilinear optimizationnonregular partitioningpiecewise modelingtree ensembles

Mathematics Subject Classification ID

Integer programming (90C10) Polynomial optimization (90C23) Nonconvex programming, global optimization (90C26)

Recommendations

• Piecewise polyhedral formulations for a multilinear term
• Optimistic MILP modeling of non-linear optimization problems
• Some results on the strength of relaxations of multilinear functions
• Piecewise-linear approximations of multidimensional functions
• Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools

Cites work

• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Approximating separable nonlinear functions via mixed zero-one programs
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Concave extensions for nonlinear 0-1 maximization problems
• Convex extensions and envelopes of lower semi-continuous functions
• Exponential lower bounds for polytopes in combinatorial optimization
• Global optimization of nonconvex problems with multilinear intermediates
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• JuMP: a modeling language for mathematical optimization
• MIP relaxations in factorable programming
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimization of tree ensembles
• Piecewise linear approximation of functions of two variables in MILP models
• Piecewise polyhedral formulations for a multilinear term
• Sequence of polyhedral relaxations for nonlinear univariate functions
• Short proofs on the matching polyhedron
• Some results on the strength of relaxations of multilinear functions
• Sparse spatial autoregressions
• The Boolean quadratic polytope: Some characteristics, facets and relatives

Cited in

(2)

• Piecewise polyhedral formulations for a multilinear term
• A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations

This page was built for publication: Piecewise polyhedral relaxations of multilinear optimization

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