Analysis of bounds for multilinear functions
The paper is concerned with the bounding of multilinear functions, which are defined as: \(\sum_{i=1}^t a_i \prod_{j\in J_i} y_i\). Such functions are the building blocks of a variety of nonconvex optimization problems. One can bound such functions via bounds for monomial functions, which are defined as the product of \(p\) variables, i.e. as \(\varphi^p(y):= \prod_{j=1}^p y_j\). The present paper considers four bounding schemes: the arithmetic interval method, the logarithmic transformation method and a new scheme, which is a variant of the interval method, the exponent transformation method and a new scheme, which is a variant of the interval method. The tightness of the four bounding schemes is theoretically compared. Further, it is proved that one of the four bounding schemes provides the convex envelope and that two of the schemes provide the concave envelope for the monomial \(\varphi^p(y)\) over \(\mathbb{R}_+^p\).
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex underestimation for posynomial functions of positive variables
- A convex envelope formula for multilinear functions
- Some results on the strength of relaxations of multilinear functions
- Convex envelopes of monomials of odd degree
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- On duality for a class of quasiconcave multiplicative programs
- On linear programming relaxations for solving polynomial programming problems
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Strong valid inequalities for Boolean logical pattern generation
- A class of valid inequalities for multilinear 0-1 optimization problems
- Convex envelopes of bivariate functions through the solution of KKT systems
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- A review of deterministic optimization methods in engineering and management
- On convex relaxations of quadrilinear terms
- Convex envelopes for ray-concave functions
- Graph, clique and facet of Boolean logical polytope
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- Global optimization of nonconvex problems with multilinear intermediates
- Data separation via a finite number of discriminant functions: a global optimization approach
- Error bounds for monomial convexification in polynomial optimization
- On convex envelopes for bivariate functions over polytopes
- Relaxations of factorable functions with convex-transformable intermediates
- Convex relaxation for solving posynomial programs
- Designing globally optimal delta-sigma modulator topologies via signomial programming
- Non polyhedral convex envelopes for 1-convex functions
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- The multilinear polytope for acyclic hypergraphs
- Multi-point bounds for analytic functions under measure conditions
- Solving generalized polynomial problem by using new affine relaxed technique
- The convex hull of a quadratic constraint over a polytope
- Multilinear analysis on metric spaces
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Convergence rate of McCormick relaxations
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- Quadratization and convexification in polynomial binary optimization
- A new branch-and-bound algorithm for generalized affine multiplicative programming
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- A graphical framework for global optimization of mixed-integer nonlinear programs
- A review of recent advances in global optimization
- A convex analysis approach for convex multiplicative programming
- Convex underestimation for posynomial functions of positive variables
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- An outcome space approach for generalized convex multiplicative programs
- Piecewise-linear approximations of multidimensional functions
This page was built for publication: Analysis of bounds for multilinear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942316)
